./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8 --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 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:54:53,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:54:53,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:54:53,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:54:53,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:54:53,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:54:53,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:54:53,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:54:53,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:54:53,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:54:53,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:54:53,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:54:53,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:54:53,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:54:53,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:54:53,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:54:53,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:54:53,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:54:53,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:54:53,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:54:53,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:54:53,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:54:53,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:54:53,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:54:53,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:54:53,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:54:53,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:54:53,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:54:53,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:54:53,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:54:53,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:54:53,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:54:53,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:54:53,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:54:53,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:54:53,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:54:53,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:54:53,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:54:53,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:54:53,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:54:53,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:54:53,836 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-07 00:54:53,893 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:54:53,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:54:53,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:54:53,896 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:54:53,896 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:54:53,896 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:54:53,896 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 00:54:53,897 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:54:53,903 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:54:53,903 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 00:54:53,903 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 00:54:53,904 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:54:53,904 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 00:54:53,904 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 00:54:53,904 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 00:54:53,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:54:53,905 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:54:53,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 00:54:53,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 00:54:53,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:54:53,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:54:53,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:54:53,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:54:53,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:54:53,907 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-07 00:54:53,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:54:53,907 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:54:53,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:54:53,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:54:53,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:54:53,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:54:53,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:54:53,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:53,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:54:53,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:54:53,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:54:53,910 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 00:54:53,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 00:54:53,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:54:53,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:54:53,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:54:53,911 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/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_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8 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 -> 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc [2021-11-07 00:54:54,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:54:54,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:54:54,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:54:54,201 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:54:54,207 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:54:54,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2021-11-07 00:54:54,284 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/data/54d37820c/73ae82a53df74d528ceaf454c2fc7d99/FLAG6a70d9b1e [2021-11-07 00:54:54,856 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:54:54,856 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2021-11-07 00:54:54,881 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/data/54d37820c/73ae82a53df74d528ceaf454c2fc7d99/FLAG6a70d9b1e [2021-11-07 00:54:55,138 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/data/54d37820c/73ae82a53df74d528ceaf454c2fc7d99 [2021-11-07 00:54:55,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:54:55,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:54:55,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:55,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:54:55,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:54:55,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:55" (1/1) ... [2021-11-07 00:54:55,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e504718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:55, skipping insertion in model container [2021-11-07 00:54:55,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:55" (1/1) ... [2021-11-07 00:54:55,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:54:55,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:54:56,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:56,204 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:54:56,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:56,355 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:54:56,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56 WrapperNode [2021-11-07 00:54:56,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:56,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:56,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:54:56,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:54:56,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:56,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:54:56,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:54:56,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:54:56,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:54:56,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:54:56,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:54:56,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:54:56,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (1/1) ... [2021-11-07 00:54:56,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:56,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:54:56,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:54:56,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:54:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:54:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 00:54:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 00:54:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 00:54:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 00:54:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-07 00:54:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 00:54:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 00:54:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-07 00:54:56,563 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-07 00:54:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 00:54:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:54:56,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:54:56,565 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-07 00:54:57,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:54:57,225 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-07 00:54:57,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:57 BoogieIcfgContainer [2021-11-07 00:54:57,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:54:57,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:54:57,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:54:57,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:54:57,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:54:55" (1/3) ... [2021-11-07 00:54:57,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af04e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:57, skipping insertion in model container [2021-11-07 00:54:57,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:56" (2/3) ... [2021-11-07 00:54:57,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af04e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:57, skipping insertion in model container [2021-11-07 00:54:57,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:57" (3/3) ... [2021-11-07 00:54:57,246 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.i [2021-11-07 00:54:57,253 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-07 00:54:57,253 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:54:57,253 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-11-07 00:54:57,254 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-07 00:54:57,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,303 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,303 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,304 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,304 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,306 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,307 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,308 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,308 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,308 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,308 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,309 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,310 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,312 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,312 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,312 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,312 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,313 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,313 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,314 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,315 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,315 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,315 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,315 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,315 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,316 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,317 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,317 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,318 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,318 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,318 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,319 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,319 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,319 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,320 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,320 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,320 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,320 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,320 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,322 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,322 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,322 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,323 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,323 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,323 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,324 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,324 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,326 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,329 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,330 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,331 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,332 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,332 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,333 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,338 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,338 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,339 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,340 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,341 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,341 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,342 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,343 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,344 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,344 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,345 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,345 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,345 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,347 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,347 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,348 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,348 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,348 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,349 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,349 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,349 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,350 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,350 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,350 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,351 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,351 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,351 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,352 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,352 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,352 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,353 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,353 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,353 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,354 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,354 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,354 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,355 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,365 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,365 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,366 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,366 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,366 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,366 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,366 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,367 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,368 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,368 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,368 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,372 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,372 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,373 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,373 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,373 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,373 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,373 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,374 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,374 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,375 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,375 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,375 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,375 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,382 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,382 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,383 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,383 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,391 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,391 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,392 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,392 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,392 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,392 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,393 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,393 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,393 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,393 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,393 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,394 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,394 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,394 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,394 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,405 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,409 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,409 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,409 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,410 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,410 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,410 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,414 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,414 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 00:54:57,420 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-07 00:54:57,484 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:54:57,495 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:54:57,495 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-11-07 00:54:57,530 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-07 00:54:57,546 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 195 transitions, 395 flow [2021-11-07 00:54:57,550 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 195 transitions, 395 flow [2021-11-07 00:54:57,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 199 places, 195 transitions, 395 flow [2021-11-07 00:54:57,682 INFO L129 PetriNetUnfolder]: 0/194 cut-off events. [2021-11-07 00:54:57,682 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 00:54:57,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 194 events. 0/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-11-07 00:54:57,690 INFO L116 LiptonReduction]: Number of co-enabled transitions 4030 [2021-11-07 00:55:34,988 WARN L207 SmtUtils]: Spent 17.81 s on a formula simplification that was a NOOP. DAG size: 181 [2021-11-07 00:55:44,470 WARN L207 SmtUtils]: Spent 9.48 s on a formula simplification that was a NOOP. DAG size: 171 [2021-11-07 00:55:56,018 WARN L207 SmtUtils]: Spent 11.55 s on a formula simplification that was a NOOP. DAG size: 181 [2021-11-07 00:56:22,442 WARN L207 SmtUtils]: Spent 26.42 s on a formula simplification that was a NOOP. DAG size: 171 [2021-11-07 00:57:43,274 WARN L207 SmtUtils]: Spent 1.32 m on a formula simplification that was a NOOP. DAG size: 311 [2021-11-07 00:58:03,044 WARN L207 SmtUtils]: Spent 19.76 s on a formula simplification that was a NOOP. DAG size: 283 [2021-11-07 00:58:31,556 WARN L207 SmtUtils]: Spent 28.51 s on a formula simplification that was a NOOP. DAG size: 311 [2021-11-07 00:58:46,993 WARN L207 SmtUtils]: Spent 15.43 s on a formula simplification that was a NOOP. DAG size: 283 [2021-11-07 00:58:47,261 INFO L131 LiptonReduction]: Checked pairs total: 59784 [2021-11-07 00:58:47,261 INFO L133 LiptonReduction]: Total number of compositions: 208 [2021-11-07 00:58:47,272 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 68 transitions, 141 flow [2021-11-07 00:58:47,325 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 764 states, 725 states have (on average 2.0124137931034483) internal successors, (1459), 763 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 764 states, 725 states have (on average 2.0124137931034483) internal successors, (1459), 763 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-07 00:58:47,334 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:47,334 INFO L513 BasicCegarLoop]: trace histogram [1] [2021-11-07 00:58:47,335 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash 672, now seen corresponding path program 1 times [2021-11-07 00:58:47,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:47,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791592055] [2021-11-07 00:58:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:47,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:47,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:47,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791592055] [2021-11-07 00:58:47,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791592055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:47,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:47,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-07 00:58:47,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938282670] [2021-11-07 00:58:47,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 00:58:47,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:47,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 00:58:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 00:58:47,495 INFO L87 Difference]: Start difference. First operand has 764 states, 725 states have (on average 2.0124137931034483) internal successors, (1459), 763 states have internal predecessors, (1459), 0 states have call successors, (0), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:47,531 INFO L93 Difference]: Finished difference Result 680 states and 1302 transitions. [2021-11-07 00:58:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 00:58:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2021-11-07 00:58:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:47,551 INFO L225 Difference]: With dead ends: 680 [2021-11-07 00:58:47,551 INFO L226 Difference]: Without dead ends: 680 [2021-11-07 00:58:47,552 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 00:58:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-11-07 00:58:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2021-11-07 00:58:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 663 states have (on average 1.9638009049773755) internal successors, (1302), 679 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1302 transitions. [2021-11-07 00:58:47,631 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1302 transitions. Word has length 1 [2021-11-07 00:58:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:47,631 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1302 transitions. [2021-11-07 00:58:47,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1302 transitions. [2021-11-07 00:58:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 00:58:47,632 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:47,633 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:47,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 00:58:47,633 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1983223833, now seen corresponding path program 1 times [2021-11-07 00:58:47,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:47,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759370451] [2021-11-07 00:58:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:47,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:47,916 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:47,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759370451] [2021-11-07 00:58:47,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759370451] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:47,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:47,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 00:58:47,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328257054] [2021-11-07 00:58:47,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:58:47,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:58:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:58:47,923 INFO L87 Difference]: Start difference. First operand 680 states and 1302 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:48,778 INFO L93 Difference]: Finished difference Result 1208 states and 2300 transitions. [2021-11-07 00:58:48,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 00:58:48,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-11-07 00:58:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:48,788 INFO L225 Difference]: With dead ends: 1208 [2021-11-07 00:58:48,788 INFO L226 Difference]: Without dead ends: 1208 [2021-11-07 00:58:48,789 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:58:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-11-07 00:58:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 786. [2021-11-07 00:58:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 772 states have (on average 1.961139896373057) internal successors, (1514), 785 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1514 transitions. [2021-11-07 00:58:48,830 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1514 transitions. Word has length 9 [2021-11-07 00:58:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:48,830 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1514 transitions. [2021-11-07 00:58:48,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1514 transitions. [2021-11-07 00:58:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 00:58:48,831 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:48,831 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:48,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 00:58:48,832 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2070038164, now seen corresponding path program 1 times [2021-11-07 00:58:48,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:48,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467211750] [2021-11-07 00:58:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:48,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:49,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:49,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467211750] [2021-11-07 00:58:49,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467211750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:49,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:49,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 00:58:49,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389650722] [2021-11-07 00:58:49,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:58:49,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:58:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:58:49,017 INFO L87 Difference]: Start difference. First operand 786 states and 1514 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:49,230 INFO L93 Difference]: Finished difference Result 842 states and 1622 transitions. [2021-11-07 00:58:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 00:58:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-11-07 00:58:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:49,237 INFO L225 Difference]: With dead ends: 842 [2021-11-07 00:58:49,237 INFO L226 Difference]: Without dead ends: 842 [2021-11-07 00:58:49,237 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:58:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-11-07 00:58:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2021-11-07 00:58:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 828 states have (on average 1.958937198067633) internal successors, (1622), 841 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1622 transitions. [2021-11-07 00:58:49,265 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1622 transitions. Word has length 9 [2021-11-07 00:58:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:49,266 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1622 transitions. [2021-11-07 00:58:49,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1622 transitions. [2021-11-07 00:58:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:58:49,267 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:49,268 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:49,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 00:58:49,268 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 630878445, now seen corresponding path program 1 times [2021-11-07 00:58:49,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:49,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241217268] [2021-11-07 00:58:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:49,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:49,707 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:49,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241217268] [2021-11-07 00:58:49,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241217268] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:49,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:49,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:49,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410902469] [2021-11-07 00:58:49,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:58:49,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:58:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:49,709 INFO L87 Difference]: Start difference. First operand 842 states and 1622 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:50,365 INFO L93 Difference]: Finished difference Result 831 states and 1600 transitions. [2021-11-07 00:58:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 00:58:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:58:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:50,372 INFO L225 Difference]: With dead ends: 831 [2021-11-07 00:58:50,372 INFO L226 Difference]: Without dead ends: 831 [2021-11-07 00:58:50,372 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:58:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2021-11-07 00:58:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 804. [2021-11-07 00:58:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 791 states have (on average 1.95448798988622) internal successors, (1546), 803 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1546 transitions. [2021-11-07 00:58:50,397 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1546 transitions. Word has length 12 [2021-11-07 00:58:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:50,397 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1546 transitions. [2021-11-07 00:58:50,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1546 transitions. [2021-11-07 00:58:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:58:50,399 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:50,399 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:50,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 00:58:50,400 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1255470372, now seen corresponding path program 1 times [2021-11-07 00:58:50,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:50,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896604008] [2021-11-07 00:58:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:50,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:50,602 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:50,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896604008] [2021-11-07 00:58:50,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896604008] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:50,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:50,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:50,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376088499] [2021-11-07 00:58:50,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:58:50,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:50,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:58:50,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:50,606 INFO L87 Difference]: Start difference. First operand 804 states and 1546 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:51,699 INFO L93 Difference]: Finished difference Result 1227 states and 2334 transitions. [2021-11-07 00:58:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 00:58:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:58:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:51,712 INFO L225 Difference]: With dead ends: 1227 [2021-11-07 00:58:51,713 INFO L226 Difference]: Without dead ends: 1227 [2021-11-07 00:58:51,713 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2021-11-07 00:58:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2021-11-07 00:58:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 803. [2021-11-07 00:58:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 790 states have (on average 1.9544303797468354) internal successors, (1544), 802 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1544 transitions. [2021-11-07 00:58:51,742 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1544 transitions. Word has length 12 [2021-11-07 00:58:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:51,743 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1544 transitions. [2021-11-07 00:58:51,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1544 transitions. [2021-11-07 00:58:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:58:51,744 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:51,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:51,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 00:58:51,745 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1130348172, now seen corresponding path program 2 times [2021-11-07 00:58:51,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:51,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989842033] [2021-11-07 00:58:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:51,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:51,991 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:51,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989842033] [2021-11-07 00:58:51,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989842033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:51,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:51,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:51,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161072594] [2021-11-07 00:58:51,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:58:51,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:51,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:58:51,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:51,993 INFO L87 Difference]: Start difference. First operand 803 states and 1544 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:53,479 INFO L93 Difference]: Finished difference Result 1237 states and 2354 transitions. [2021-11-07 00:58:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:58:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:58:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:53,488 INFO L225 Difference]: With dead ends: 1237 [2021-11-07 00:58:53,488 INFO L226 Difference]: Without dead ends: 1237 [2021-11-07 00:58:53,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:58:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2021-11-07 00:58:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 805. [2021-11-07 00:58:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 792 states have (on average 1.9545454545454546) internal successors, (1548), 804 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1548 transitions. [2021-11-07 00:58:53,519 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1548 transitions. Word has length 12 [2021-11-07 00:58:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:53,519 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1548 transitions. [2021-11-07 00:58:53,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1548 transitions. [2021-11-07 00:58:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:58:53,520 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:53,521 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:53,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 00:58:53,521 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1122996522, now seen corresponding path program 3 times [2021-11-07 00:58:53,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:53,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578501839] [2021-11-07 00:58:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:53,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:53,972 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:53,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578501839] [2021-11-07 00:58:53,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578501839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:53,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:53,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:53,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506229356] [2021-11-07 00:58:53,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:58:53,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:53,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:58:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:53,974 INFO L87 Difference]: Start difference. First operand 805 states and 1548 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:55,530 INFO L93 Difference]: Finished difference Result 1235 states and 2350 transitions. [2021-11-07 00:58:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:58:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:58:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:55,538 INFO L225 Difference]: With dead ends: 1235 [2021-11-07 00:58:55,538 INFO L226 Difference]: Without dead ends: 1235 [2021-11-07 00:58:55,538 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:58:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2021-11-07 00:58:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 806. [2021-11-07 00:58:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 793 states have (on average 1.9546027742749055) internal successors, (1550), 805 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1550 transitions. [2021-11-07 00:58:55,567 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1550 transitions. Word has length 12 [2021-11-07 00:58:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:55,568 INFO L470 AbstractCegarLoop]: Abstraction has 806 states and 1550 transitions. [2021-11-07 00:58:55,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1550 transitions. [2021-11-07 00:58:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:58:55,569 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:55,569 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:55,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 00:58:55,570 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1122779832, now seen corresponding path program 4 times [2021-11-07 00:58:55,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:55,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130049725] [2021-11-07 00:58:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:55,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:55,998 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:55,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130049725] [2021-11-07 00:58:55,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130049725] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:55,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:55,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:55,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484549745] [2021-11-07 00:58:55,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:58:55,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:58:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:56,000 INFO L87 Difference]: Start difference. First operand 806 states and 1550 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:57,106 INFO L93 Difference]: Finished difference Result 1222 states and 2325 transitions. [2021-11-07 00:58:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:58:57,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:58:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:57,115 INFO L225 Difference]: With dead ends: 1222 [2021-11-07 00:58:57,115 INFO L226 Difference]: Without dead ends: 1222 [2021-11-07 00:58:57,116 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:58:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2021-11-07 00:58:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 807. [2021-11-07 00:58:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 794 states have (on average 1.9546599496221662) internal successors, (1552), 806 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1552 transitions. [2021-11-07 00:58:57,148 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1552 transitions. Word has length 12 [2021-11-07 00:58:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:57,148 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 1552 transitions. [2021-11-07 00:58:57,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1552 transitions. [2021-11-07 00:58:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:58:57,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:57,152 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:57,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 00:58:57,153 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash -234181164, now seen corresponding path program 5 times [2021-11-07 00:58:57,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:57,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656697655] [2021-11-07 00:58:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:57,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:57,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:57,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656697655] [2021-11-07 00:58:57,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656697655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:57,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:57,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:57,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486297648] [2021-11-07 00:58:57,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:58:57,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:58:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:57,461 INFO L87 Difference]: Start difference. First operand 807 states and 1552 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:58,867 INFO L93 Difference]: Finished difference Result 1287 states and 2450 transitions. [2021-11-07 00:58:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 00:58:58,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:58:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:58,876 INFO L225 Difference]: With dead ends: 1287 [2021-11-07 00:58:58,876 INFO L226 Difference]: Without dead ends: 1287 [2021-11-07 00:58:58,877 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-11-07 00:58:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2021-11-07 00:58:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 811. [2021-11-07 00:58:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 798 states have (on average 1.9548872180451127) internal successors, (1560), 810 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1560 transitions. [2021-11-07 00:58:58,904 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1560 transitions. Word has length 12 [2021-11-07 00:58:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:58,905 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1560 transitions. [2021-11-07 00:58:58,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:58:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1560 transitions. [2021-11-07 00:58:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:58:58,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:58,906 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:58,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 00:58:58,906 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:58:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash -241532814, now seen corresponding path program 6 times [2021-11-07 00:58:58,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:58,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872330133] [2021-11-07 00:58:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:58,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:59,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:59,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872330133] [2021-11-07 00:58:59,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872330133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:59,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:59,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:58:59,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560389332] [2021-11-07 00:58:59,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:58:59,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:59,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:58:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:59,358 INFO L87 Difference]: Start difference. First operand 811 states and 1560 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:00,358 INFO L93 Difference]: Finished difference Result 1263 states and 2404 transitions. [2021-11-07 00:59:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 00:59:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:00,366 INFO L225 Difference]: With dead ends: 1263 [2021-11-07 00:59:00,366 INFO L226 Difference]: Without dead ends: 1263 [2021-11-07 00:59:00,367 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-11-07 00:59:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2021-11-07 00:59:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 813. [2021-11-07 00:59:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 800 states have (on average 1.955) internal successors, (1564), 812 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1564 transitions. [2021-11-07 00:59:00,393 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1564 transitions. Word has length 12 [2021-11-07 00:59:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:00,394 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1564 transitions. [2021-11-07 00:59:00,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1564 transitions. [2021-11-07 00:59:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:00,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:00,395 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:00,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 00:59:00,395 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash -241749504, now seen corresponding path program 7 times [2021-11-07 00:59:00,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:00,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149802573] [2021-11-07 00:59:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:00,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:00,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:00,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149802573] [2021-11-07 00:59:00,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149802573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:00,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:00,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:00,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080499857] [2021-11-07 00:59:00,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:00,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:00,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:00,969 INFO L87 Difference]: Start difference. First operand 813 states and 1564 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:02,127 INFO L93 Difference]: Finished difference Result 1230 states and 2341 transitions. [2021-11-07 00:59:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:02,134 INFO L225 Difference]: With dead ends: 1230 [2021-11-07 00:59:02,135 INFO L226 Difference]: Without dead ends: 1230 [2021-11-07 00:59:02,135 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-11-07 00:59:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-11-07 00:59:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 810. [2021-11-07 00:59:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 797 states have (on average 1.9548306148055208) internal successors, (1558), 809 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1558 transitions. [2021-11-07 00:59:02,163 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1558 transitions. Word has length 12 [2021-11-07 00:59:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:02,163 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1558 transitions. [2021-11-07 00:59:02,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1558 transitions. [2021-11-07 00:59:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:02,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:02,164 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:02,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 00:59:02,165 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1016695808, now seen corresponding path program 8 times [2021-11-07 00:59:02,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:02,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115677305] [2021-11-07 00:59:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:02,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:02,571 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:02,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115677305] [2021-11-07 00:59:02,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115677305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:02,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:02,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:02,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117806787] [2021-11-07 00:59:02,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:02,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:02,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:02,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:02,573 INFO L87 Difference]: Start difference. First operand 810 states and 1558 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:03,969 INFO L93 Difference]: Finished difference Result 1283 states and 2442 transitions. [2021-11-07 00:59:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 00:59:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:03,976 INFO L225 Difference]: With dead ends: 1283 [2021-11-07 00:59:03,976 INFO L226 Difference]: Without dead ends: 1283 [2021-11-07 00:59:03,977 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-11-07 00:59:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-11-07 00:59:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 812. [2021-11-07 00:59:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 799 states have (on average 1.9549436795994994) internal successors, (1562), 811 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1562 transitions. [2021-11-07 00:59:04,003 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1562 transitions. Word has length 12 [2021-11-07 00:59:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:04,003 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1562 transitions. [2021-11-07 00:59:04,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1562 transitions. [2021-11-07 00:59:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:04,004 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:04,004 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:04,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 00:59:04,005 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1016912498, now seen corresponding path program 9 times [2021-11-07 00:59:04,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:04,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048388226] [2021-11-07 00:59:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:04,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:04,528 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:04,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048388226] [2021-11-07 00:59:04,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048388226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:04,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:04,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:04,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414912245] [2021-11-07 00:59:04,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:04,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:04,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:04,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:04,530 INFO L87 Difference]: Start difference. First operand 812 states and 1562 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:05,585 INFO L93 Difference]: Finished difference Result 1264 states and 2406 transitions. [2021-11-07 00:59:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:05,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:05,592 INFO L225 Difference]: With dead ends: 1264 [2021-11-07 00:59:05,592 INFO L226 Difference]: Without dead ends: 1264 [2021-11-07 00:59:05,593 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-07 00:59:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2021-11-07 00:59:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 811. [2021-11-07 00:59:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 798 states have (on average 1.9548872180451127) internal successors, (1560), 810 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1560 transitions. [2021-11-07 00:59:05,627 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1560 transitions. Word has length 12 [2021-11-07 00:59:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:05,628 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1560 transitions. [2021-11-07 00:59:05,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1560 transitions. [2021-11-07 00:59:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:05,629 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:05,629 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:05,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 00:59:05,629 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1283244038, now seen corresponding path program 10 times [2021-11-07 00:59:05,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:05,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844307809] [2021-11-07 00:59:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:05,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:06,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:06,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844307809] [2021-11-07 00:59:06,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844307809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:06,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:06,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:06,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108684607] [2021-11-07 00:59:06,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:06,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:06,005 INFO L87 Difference]: Start difference. First operand 811 states and 1560 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:07,286 INFO L93 Difference]: Finished difference Result 1268 states and 2413 transitions. [2021-11-07 00:59:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:07,293 INFO L225 Difference]: With dead ends: 1268 [2021-11-07 00:59:07,293 INFO L226 Difference]: Without dead ends: 1268 [2021-11-07 00:59:07,293 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:59:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2021-11-07 00:59:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 811. [2021-11-07 00:59:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 798 states have (on average 1.9548872180451127) internal successors, (1560), 810 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1560 transitions. [2021-11-07 00:59:07,318 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1560 transitions. Word has length 12 [2021-11-07 00:59:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:07,318 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1560 transitions. [2021-11-07 00:59:07,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1560 transitions. [2021-11-07 00:59:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:07,319 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:07,320 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:07,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 00:59:07,320 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1679688716, now seen corresponding path program 11 times [2021-11-07 00:59:07,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:07,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524687789] [2021-11-07 00:59:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:07,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:07,548 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:07,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524687789] [2021-11-07 00:59:07,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524687789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:07,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:07,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:07,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816782323] [2021-11-07 00:59:07,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:07,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:07,550 INFO L87 Difference]: Start difference. First operand 811 states and 1560 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:09,005 INFO L93 Difference]: Finished difference Result 1289 states and 2453 transitions. [2021-11-07 00:59:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 00:59:09,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:09,013 INFO L225 Difference]: With dead ends: 1289 [2021-11-07 00:59:09,013 INFO L226 Difference]: Without dead ends: 1289 [2021-11-07 00:59:09,014 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2021-11-07 00:59:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2021-11-07 00:59:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 810. [2021-11-07 00:59:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 797 states have (on average 1.9548306148055208) internal successors, (1558), 809 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1558 transitions. [2021-11-07 00:59:09,039 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1558 transitions. Word has length 12 [2021-11-07 00:59:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:09,039 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1558 transitions. [2021-11-07 00:59:09,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1558 transitions. [2021-11-07 00:59:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:09,040 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:09,040 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:09,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 00:59:09,041 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1672337066, now seen corresponding path program 12 times [2021-11-07 00:59:09,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:09,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746965788] [2021-11-07 00:59:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:09,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:09,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:09,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746965788] [2021-11-07 00:59:09,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746965788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:09,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:09,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:09,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851055091] [2021-11-07 00:59:09,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:09,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:09,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:09,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:09,484 INFO L87 Difference]: Start difference. First operand 810 states and 1558 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:10,595 INFO L93 Difference]: Finished difference Result 1265 states and 2407 transitions. [2021-11-07 00:59:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 00:59:10,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:10,601 INFO L225 Difference]: With dead ends: 1265 [2021-11-07 00:59:10,601 INFO L226 Difference]: Without dead ends: 1265 [2021-11-07 00:59:10,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-07 00:59:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-11-07 00:59:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 812. [2021-11-07 00:59:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 799 states have (on average 1.9549436795994994) internal successors, (1562), 811 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1562 transitions. [2021-11-07 00:59:10,628 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1562 transitions. Word has length 12 [2021-11-07 00:59:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:10,628 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1562 transitions. [2021-11-07 00:59:10,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1562 transitions. [2021-11-07 00:59:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:10,629 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:10,629 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:10,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 00:59:10,630 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1672120376, now seen corresponding path program 13 times [2021-11-07 00:59:10,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:10,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502256270] [2021-11-07 00:59:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:10,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:11,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:11,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502256270] [2021-11-07 00:59:11,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502256270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:11,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:11,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:11,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58944147] [2021-11-07 00:59:11,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:11,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:11,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:11,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:11,200 INFO L87 Difference]: Start difference. First operand 812 states and 1562 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:12,375 INFO L93 Difference]: Finished difference Result 1232 states and 2344 transitions. [2021-11-07 00:59:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:12,383 INFO L225 Difference]: With dead ends: 1232 [2021-11-07 00:59:12,383 INFO L226 Difference]: Without dead ends: 1232 [2021-11-07 00:59:12,383 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:59:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2021-11-07 00:59:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 809. [2021-11-07 00:59:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 796 states have (on average 1.9547738693467336) internal successors, (1556), 808 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1556 transitions. [2021-11-07 00:59:12,406 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1556 transitions. Word has length 12 [2021-11-07 00:59:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:12,406 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 1556 transitions. [2021-11-07 00:59:12,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1556 transitions. [2021-11-07 00:59:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:12,407 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:12,408 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:12,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 00:59:12,408 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 897174072, now seen corresponding path program 14 times [2021-11-07 00:59:12,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:12,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754094161] [2021-11-07 00:59:12,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:12,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:12,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:12,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754094161] [2021-11-07 00:59:12,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754094161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:12,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:12,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:12,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863596788] [2021-11-07 00:59:12,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:12,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:12,858 INFO L87 Difference]: Start difference. First operand 809 states and 1556 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:14,176 INFO L93 Difference]: Finished difference Result 1277 states and 2430 transitions. [2021-11-07 00:59:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 00:59:14,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:14,182 INFO L225 Difference]: With dead ends: 1277 [2021-11-07 00:59:14,183 INFO L226 Difference]: Without dead ends: 1277 [2021-11-07 00:59:14,183 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-11-07 00:59:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2021-11-07 00:59:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 813. [2021-11-07 00:59:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 800 states have (on average 1.955) internal successors, (1564), 812 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1564 transitions. [2021-11-07 00:59:14,206 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1564 transitions. Word has length 12 [2021-11-07 00:59:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:14,206 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1564 transitions. [2021-11-07 00:59:14,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1564 transitions. [2021-11-07 00:59:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:14,207 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:14,207 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:14,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 00:59:14,208 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash 896957382, now seen corresponding path program 15 times [2021-11-07 00:59:14,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:14,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106587632] [2021-11-07 00:59:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:14,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:14,697 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:14,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106587632] [2021-11-07 00:59:14,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106587632] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:14,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:14,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:14,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992527802] [2021-11-07 00:59:14,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:14,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:14,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:14,699 INFO L87 Difference]: Start difference. First operand 813 states and 1564 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:16,017 INFO L93 Difference]: Finished difference Result 1250 states and 2379 transitions. [2021-11-07 00:59:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:16,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:16,022 INFO L225 Difference]: With dead ends: 1250 [2021-11-07 00:59:16,022 INFO L226 Difference]: Without dead ends: 1250 [2021-11-07 00:59:16,022 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:59:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-11-07 00:59:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 812. [2021-11-07 00:59:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 799 states have (on average 1.9549436795994994) internal successors, (1562), 811 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1562 transitions. [2021-11-07 00:59:16,044 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1562 transitions. Word has length 12 [2021-11-07 00:59:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:16,045 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1562 transitions. [2021-11-07 00:59:16,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1562 transitions. [2021-11-07 00:59:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:16,046 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:16,046 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:16,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 00:59:16,047 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash 630625842, now seen corresponding path program 16 times [2021-11-07 00:59:16,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:16,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805382938] [2021-11-07 00:59:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:16,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:16,448 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:16,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805382938] [2021-11-07 00:59:16,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805382938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:16,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:16,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:16,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180770469] [2021-11-07 00:59:16,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:16,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:16,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:16,450 INFO L87 Difference]: Start difference. First operand 812 states and 1562 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:17,534 INFO L93 Difference]: Finished difference Result 1242 states and 2363 transitions. [2021-11-07 00:59:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:17,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:17,538 INFO L225 Difference]: With dead ends: 1242 [2021-11-07 00:59:17,538 INFO L226 Difference]: Without dead ends: 1242 [2021-11-07 00:59:17,538 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:59:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2021-11-07 00:59:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 808. [2021-11-07 00:59:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 795 states have (on average 1.9547169811320755) internal successors, (1554), 807 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1554 transitions. [2021-11-07 00:59:17,561 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1554 transitions. Word has length 12 [2021-11-07 00:59:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:17,561 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1554 transitions. [2021-11-07 00:59:17,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1554 transitions. [2021-11-07 00:59:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:17,562 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:17,562 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:17,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 00:59:17,563 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 62085382, now seen corresponding path program 17 times [2021-11-07 00:59:17,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:17,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722419403] [2021-11-07 00:59:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:17,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:17,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:17,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722419403] [2021-11-07 00:59:17,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722419403] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:17,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:17,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:17,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127096701] [2021-11-07 00:59:17,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:17,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:17,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:17,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:17,827 INFO L87 Difference]: Start difference. First operand 808 states and 1554 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:19,210 INFO L93 Difference]: Finished difference Result 1284 states and 2443 transitions. [2021-11-07 00:59:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 00:59:19,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:19,214 INFO L225 Difference]: With dead ends: 1284 [2021-11-07 00:59:19,214 INFO L226 Difference]: Without dead ends: 1284 [2021-11-07 00:59:19,214 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:59:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2021-11-07 00:59:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 807. [2021-11-07 00:59:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 794 states have (on average 1.9546599496221662) internal successors, (1552), 806 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1552 transitions. [2021-11-07 00:59:19,237 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1552 transitions. Word has length 12 [2021-11-07 00:59:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:19,238 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 1552 transitions. [2021-11-07 00:59:19,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1552 transitions. [2021-11-07 00:59:19,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:19,239 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:19,239 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:19,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 00:59:19,239 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 61868692, now seen corresponding path program 18 times [2021-11-07 00:59:19,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:19,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411694982] [2021-11-07 00:59:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:19,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:19,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:19,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411694982] [2021-11-07 00:59:19,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411694982] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:19,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:19,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:19,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882830082] [2021-11-07 00:59:19,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:19,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:19,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:19,773 INFO L87 Difference]: Start difference. First operand 807 states and 1552 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:20,906 INFO L93 Difference]: Finished difference Result 1265 states and 2407 transitions. [2021-11-07 00:59:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:20,911 INFO L225 Difference]: With dead ends: 1265 [2021-11-07 00:59:20,911 INFO L226 Difference]: Without dead ends: 1265 [2021-11-07 00:59:20,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:59:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-11-07 00:59:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 806. [2021-11-07 00:59:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 793 states have (on average 1.9546027742749055) internal successors, (1550), 805 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1550 transitions. [2021-11-07 00:59:20,933 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1550 transitions. Word has length 12 [2021-11-07 00:59:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:20,934 INFO L470 AbstractCegarLoop]: Abstraction has 806 states and 1550 transitions. [2021-11-07 00:59:20,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1550 transitions. [2021-11-07 00:59:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:20,935 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:20,935 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:20,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 00:59:20,935 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -204462848, now seen corresponding path program 19 times [2021-11-07 00:59:20,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:20,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253749956] [2021-11-07 00:59:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:20,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:21,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:21,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253749956] [2021-11-07 00:59:21,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253749956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:21,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:21,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:21,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697951054] [2021-11-07 00:59:21,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:21,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:21,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:21,361 INFO L87 Difference]: Start difference. First operand 806 states and 1550 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:22,547 INFO L93 Difference]: Finished difference Result 1276 states and 2428 transitions. [2021-11-07 00:59:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:22,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:22,550 INFO L225 Difference]: With dead ends: 1276 [2021-11-07 00:59:22,550 INFO L226 Difference]: Without dead ends: 1276 [2021-11-07 00:59:22,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:59:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2021-11-07 00:59:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 805. [2021-11-07 00:59:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 792 states have (on average 1.9545454545454546) internal successors, (1548), 804 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1548 transitions. [2021-11-07 00:59:22,570 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1548 transitions. Word has length 12 [2021-11-07 00:59:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:22,570 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1548 transitions. [2021-11-07 00:59:22,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1548 transitions. [2021-11-07 00:59:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:59:22,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:22,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:22,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 00:59:22,572 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:22,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash -369507336, now seen corresponding path program 20 times [2021-11-07 00:59:22,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:22,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435831270] [2021-11-07 00:59:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:22,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:22,972 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:22,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435831270] [2021-11-07 00:59:22,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435831270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:22,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:22,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:22,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134364299] [2021-11-07 00:59:22,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:22,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:22,974 INFO L87 Difference]: Start difference. First operand 805 states and 1548 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:24,819 INFO L93 Difference]: Finished difference Result 1268 states and 2412 transitions. [2021-11-07 00:59:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:59:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 12 [2021-11-07 00:59:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:24,822 INFO L225 Difference]: With dead ends: 1268 [2021-11-07 00:59:24,822 INFO L226 Difference]: Without dead ends: 1268 [2021-11-07 00:59:24,822 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:59:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2021-11-07 00:59:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 799. [2021-11-07 00:59:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 786 states have (on average 1.9541984732824427) internal successors, (1536), 798 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1536 transitions. [2021-11-07 00:59:24,840 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1536 transitions. Word has length 12 [2021-11-07 00:59:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:24,840 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1536 transitions. [2021-11-07 00:59:24,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2021-11-07 00:59:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1536 transitions. [2021-11-07 00:59:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 00:59:24,841 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:24,841 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:24,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 00:59:24,842 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 961476539, now seen corresponding path program 1 times [2021-11-07 00:59:24,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:24,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619552302] [2021-11-07 00:59:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:24,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:25,000 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:25,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619552302] [2021-11-07 00:59:25,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619552302] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:25,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:25,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:25,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936085356] [2021-11-07 00:59:25,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:25,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:25,002 INFO L87 Difference]: Start difference. First operand 799 states and 1536 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) [2021-11-07 00:59:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:26,162 INFO L93 Difference]: Finished difference Result 1146 states and 2179 transitions. [2021-11-07 00:59:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 00:59:26,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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 13 [2021-11-07 00:59:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:26,164 INFO L225 Difference]: With dead ends: 1146 [2021-11-07 00:59:26,164 INFO L226 Difference]: Without dead ends: 1146 [2021-11-07 00:59:26,164 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2021-11-07 00:59:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-11-07 00:59:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 774. [2021-11-07 00:59:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 761 states have (on average 1.9526938239159002) internal successors, (1486), 773 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1486 transitions. [2021-11-07 00:59:26,182 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1486 transitions. Word has length 13 [2021-11-07 00:59:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:26,183 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1486 transitions. [2021-11-07 00:59:26,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) [2021-11-07 00:59:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1486 transitions. [2021-11-07 00:59:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:59:26,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:26,184 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:26,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 00:59:26,184 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1121375793, now seen corresponding path program 1 times [2021-11-07 00:59:26,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:26,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103895286] [2021-11-07 00:59:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:26,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:26,259 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:26,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103895286] [2021-11-07 00:59:26,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103895286] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:26,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:26,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 00:59:26,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47658507] [2021-11-07 00:59:26,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:59:26,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:26,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:59:26,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:59:26,262 INFO L87 Difference]: Start difference. First operand 774 states and 1486 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:26,544 INFO L93 Difference]: Finished difference Result 1011 states and 1916 transitions. [2021-11-07 00:59:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 00:59:26,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 [2021-11-07 00:59:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:26,547 INFO L225 Difference]: With dead ends: 1011 [2021-11-07 00:59:26,547 INFO L226 Difference]: Without dead ends: 985 [2021-11-07 00:59:26,547 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:59:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-11-07 00:59:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 880. [2021-11-07 00:59:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 867 states have (on average 1.9515570934256055) internal successors, (1692), 879 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1692 transitions. [2021-11-07 00:59:26,566 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1692 transitions. Word has length 15 [2021-11-07 00:59:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:26,566 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1692 transitions. [2021-11-07 00:59:26,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1692 transitions. [2021-11-07 00:59:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:59:26,567 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:26,567 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:26,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 00:59:26,568 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:26,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2057090947, now seen corresponding path program 1 times [2021-11-07 00:59:26,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:26,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139568562] [2021-11-07 00:59:26,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:26,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:26,680 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:26,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139568562] [2021-11-07 00:59:26,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139568562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:26,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:26,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 00:59:26,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584164764] [2021-11-07 00:59:26,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:59:26,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:59:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:59:26,683 INFO L87 Difference]: Start difference. First operand 880 states and 1692 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:26,947 INFO L93 Difference]: Finished difference Result 935 states and 1798 transitions. [2021-11-07 00:59:26,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 00:59:26,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 [2021-11-07 00:59:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:26,954 INFO L225 Difference]: With dead ends: 935 [2021-11-07 00:59:26,954 INFO L226 Difference]: Without dead ends: 935 [2021-11-07 00:59:26,955 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:59:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-11-07 00:59:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2021-11-07 00:59:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 922 states have (on average 1.9501084598698482) internal successors, (1798), 934 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1798 transitions. [2021-11-07 00:59:26,981 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1798 transitions. Word has length 15 [2021-11-07 00:59:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:26,981 INFO L470 AbstractCegarLoop]: Abstraction has 935 states and 1798 transitions. [2021-11-07 00:59:26,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1798 transitions. [2021-11-07 00:59:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:26,983 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:26,983 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:26,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 00:59:26,983 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1788730506, now seen corresponding path program 1 times [2021-11-07 00:59:26,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:26,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509392795] [2021-11-07 00:59:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:26,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:27,136 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:27,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509392795] [2021-11-07 00:59:27,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509392795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:27,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:27,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:27,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702248751] [2021-11-07 00:59:27,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:27,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:27,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:27,138 INFO L87 Difference]: Start difference. First operand 935 states and 1798 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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) [2021-11-07 00:59:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:27,906 INFO L93 Difference]: Finished difference Result 956 states and 1807 transitions. [2021-11-07 00:59:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 00:59:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 18 [2021-11-07 00:59:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:27,912 INFO L225 Difference]: With dead ends: 956 [2021-11-07 00:59:27,912 INFO L226 Difference]: Without dead ends: 956 [2021-11-07 00:59:27,913 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2021-11-07 00:59:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-11-07 00:59:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 897. [2021-11-07 00:59:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 885 states have (on average 1.9457627118644067) internal successors, (1722), 896 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1722 transitions. [2021-11-07 00:59:27,936 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1722 transitions. Word has length 18 [2021-11-07 00:59:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:27,937 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 1722 transitions. [2021-11-07 00:59:27,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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) [2021-11-07 00:59:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1722 transitions. [2021-11-07 00:59:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:27,938 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:27,938 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:27,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 00:59:27,939 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1427959953, now seen corresponding path program 1 times [2021-11-07 00:59:27,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:27,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084624467] [2021-11-07 00:59:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:27,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:28,122 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:28,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084624467] [2021-11-07 00:59:28,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084624467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:28,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:28,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 00:59:28,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526802489] [2021-11-07 00:59:28,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 00:59:28,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 00:59:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:59:28,124 INFO L87 Difference]: Start difference. First operand 897 states and 1722 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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) [2021-11-07 00:59:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:29,157 INFO L93 Difference]: Finished difference Result 1189 states and 2238 transitions. [2021-11-07 00:59:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 00:59:29,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 18 [2021-11-07 00:59:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:29,159 INFO L225 Difference]: With dead ends: 1189 [2021-11-07 00:59:29,159 INFO L226 Difference]: Without dead ends: 1189 [2021-11-07 00:59:29,160 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2021-11-07 00:59:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2021-11-07 00:59:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 855. [2021-11-07 00:59:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 843 states have (on average 1.9466192170818506) internal successors, (1641), 854 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1641 transitions. [2021-11-07 00:59:29,178 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1641 transitions. Word has length 18 [2021-11-07 00:59:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:29,178 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1641 transitions. [2021-11-07 00:59:29,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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) [2021-11-07 00:59:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1641 transitions. [2021-11-07 00:59:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:29,179 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:29,179 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:29,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 00:59:29,180 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1842306853, now seen corresponding path program 1 times [2021-11-07 00:59:29,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:29,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099140137] [2021-11-07 00:59:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:29,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:29,859 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:29,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099140137] [2021-11-07 00:59:29,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099140137] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:29,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:29,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:29,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514404206] [2021-11-07 00:59:29,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:29,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:29,861 INFO L87 Difference]: Start difference. First operand 855 states and 1641 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:30,870 INFO L93 Difference]: Finished difference Result 888 states and 1687 transitions. [2021-11-07 00:59:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 00:59:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:30,872 INFO L225 Difference]: With dead ends: 888 [2021-11-07 00:59:30,872 INFO L226 Difference]: Without dead ends: 888 [2021-11-07 00:59:30,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=471, Unknown=0, NotChecked=0, Total=702 [2021-11-07 00:59:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2021-11-07 00:59:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 866. [2021-11-07 00:59:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 854 states have (on average 1.9473067915690867) internal successors, (1663), 865 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1663 transitions. [2021-11-07 00:59:30,889 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1663 transitions. Word has length 18 [2021-11-07 00:59:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:30,889 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1663 transitions. [2021-11-07 00:59:30,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1663 transitions. [2021-11-07 00:59:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:30,890 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:30,890 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:30,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 00:59:30,891 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1400581271, now seen corresponding path program 2 times [2021-11-07 00:59:30,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:30,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855406071] [2021-11-07 00:59:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:30,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:31,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:31,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855406071] [2021-11-07 00:59:31,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855406071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:31,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:31,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:31,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836188233] [2021-11-07 00:59:31,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:31,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:31,576 INFO L87 Difference]: Start difference. First operand 866 states and 1663 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:32,840 INFO L93 Difference]: Finished difference Result 909 states and 1728 transitions. [2021-11-07 00:59:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:59:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:32,844 INFO L225 Difference]: With dead ends: 909 [2021-11-07 00:59:32,844 INFO L226 Difference]: Without dead ends: 909 [2021-11-07 00:59:32,844 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2021-11-07 00:59:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-11-07 00:59:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 871. [2021-11-07 00:59:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 859 states have (on average 1.9476135040745053) internal successors, (1673), 870 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1673 transitions. [2021-11-07 00:59:32,864 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1673 transitions. Word has length 18 [2021-11-07 00:59:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:32,864 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1673 transitions. [2021-11-07 00:59:32,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1673 transitions. [2021-11-07 00:59:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:32,866 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:32,866 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:32,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 00:59:32,866 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1414963175, now seen corresponding path program 3 times [2021-11-07 00:59:32,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:32,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109231860] [2021-11-07 00:59:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:32,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:33,927 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:33,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109231860] [2021-11-07 00:59:33,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109231860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:33,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:33,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:33,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887346347] [2021-11-07 00:59:33,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:33,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:33,929 INFO L87 Difference]: Start difference. First operand 871 states and 1673 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:35,882 INFO L93 Difference]: Finished difference Result 916 states and 1741 transitions. [2021-11-07 00:59:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 00:59:35,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:35,884 INFO L225 Difference]: With dead ends: 916 [2021-11-07 00:59:35,884 INFO L226 Difference]: Without dead ends: 916 [2021-11-07 00:59:35,885 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=302, Invalid=628, Unknown=0, NotChecked=0, Total=930 [2021-11-07 00:59:35,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-11-07 00:59:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 880. [2021-11-07 00:59:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 868 states have (on average 1.9481566820276497) internal successors, (1691), 879 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1691 transitions. [2021-11-07 00:59:35,901 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1691 transitions. Word has length 18 [2021-11-07 00:59:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:35,902 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1691 transitions. [2021-11-07 00:59:35,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1691 transitions. [2021-11-07 00:59:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:35,903 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:35,903 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:35,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 00:59:35,904 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1545427453, now seen corresponding path program 4 times [2021-11-07 00:59:35,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:35,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530293816] [2021-11-07 00:59:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:35,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:36,615 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:36,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530293816] [2021-11-07 00:59:36,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530293816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:36,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:36,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:36,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401245667] [2021-11-07 00:59:36,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:36,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:36,617 INFO L87 Difference]: Start difference. First operand 880 states and 1691 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:37,780 INFO L93 Difference]: Finished difference Result 935 states and 1779 transitions. [2021-11-07 00:59:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 00:59:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:37,782 INFO L225 Difference]: With dead ends: 935 [2021-11-07 00:59:37,782 INFO L226 Difference]: Without dead ends: 935 [2021-11-07 00:59:37,782 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2021-11-07 00:59:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-11-07 00:59:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 890. [2021-11-07 00:59:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 878 states have (on average 1.94874715261959) internal successors, (1711), 889 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1711 transitions. [2021-11-07 00:59:37,798 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1711 transitions. Word has length 18 [2021-11-07 00:59:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:37,799 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 1711 transitions. [2021-11-07 00:59:37,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1711 transitions. [2021-11-07 00:59:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:37,806 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:37,807 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:37,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 00:59:37,807 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1559809357, now seen corresponding path program 5 times [2021-11-07 00:59:37,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:37,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889983695] [2021-11-07 00:59:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:37,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:38,836 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:38,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889983695] [2021-11-07 00:59:38,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889983695] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:38,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:38,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:38,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927684044] [2021-11-07 00:59:38,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:38,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:38,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:38,838 INFO L87 Difference]: Start difference. First operand 890 states and 1711 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:40,548 INFO L93 Difference]: Finished difference Result 958 states and 1823 transitions. [2021-11-07 00:59:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:59:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:40,550 INFO L225 Difference]: With dead ends: 958 [2021-11-07 00:59:40,551 INFO L226 Difference]: Without dead ends: 958 [2021-11-07 00:59:40,551 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=557, Unknown=0, NotChecked=0, Total=812 [2021-11-07 00:59:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-11-07 00:59:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 885. [2021-11-07 00:59:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 873 states have (on average 1.9484536082474226) internal successors, (1701), 884 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1701 transitions. [2021-11-07 00:59:40,569 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1701 transitions. Word has length 18 [2021-11-07 00:59:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:40,569 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1701 transitions. [2021-11-07 00:59:40,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1701 transitions. [2021-11-07 00:59:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:40,570 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:40,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:40,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 00:59:40,571 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:40,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1808211355, now seen corresponding path program 6 times [2021-11-07 00:59:40,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:40,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772260049] [2021-11-07 00:59:40,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:40,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:41,385 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:41,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772260049] [2021-11-07 00:59:41,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772260049] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:41,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:41,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:41,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192253401] [2021-11-07 00:59:41,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:41,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:41,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:41,387 INFO L87 Difference]: Start difference. First operand 885 states and 1701 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:43,035 INFO L93 Difference]: Finished difference Result 949 states and 1805 transitions. [2021-11-07 00:59:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:59:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:43,037 INFO L225 Difference]: With dead ends: 949 [2021-11-07 00:59:43,037 INFO L226 Difference]: Without dead ends: 949 [2021-11-07 00:59:43,038 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=552, Unknown=0, NotChecked=0, Total=812 [2021-11-07 00:59:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-11-07 00:59:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 894. [2021-11-07 00:59:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 882 states have (on average 1.9489795918367347) internal successors, (1719), 893 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1719 transitions. [2021-11-07 00:59:43,053 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1719 transitions. Word has length 18 [2021-11-07 00:59:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:43,053 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 1719 transitions. [2021-11-07 00:59:43,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1719 transitions. [2021-11-07 00:59:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:43,054 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:43,054 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:43,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 00:59:43,055 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash -628241419, now seen corresponding path program 7 times [2021-11-07 00:59:43,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:43,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308673373] [2021-11-07 00:59:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:43,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:43,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:43,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308673373] [2021-11-07 00:59:43,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308673373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:43,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:43,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:43,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657904212] [2021-11-07 00:59:43,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:43,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:43,677 INFO L87 Difference]: Start difference. First operand 894 states and 1719 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:44,748 INFO L93 Difference]: Finished difference Result 960 states and 1828 transitions. [2021-11-07 00:59:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 00:59:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:44,751 INFO L225 Difference]: With dead ends: 960 [2021-11-07 00:59:44,751 INFO L226 Difference]: Without dead ends: 960 [2021-11-07 00:59:44,751 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-11-07 00:59:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-11-07 00:59:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 909. [2021-11-07 00:59:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 897 states have (on average 1.9498327759197325) internal successors, (1749), 908 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1749 transitions. [2021-11-07 00:59:44,767 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1749 transitions. Word has length 18 [2021-11-07 00:59:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:44,767 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1749 transitions. [2021-11-07 00:59:44,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1749 transitions. [2021-11-07 00:59:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:44,768 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:44,769 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:44,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 00:59:44,769 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:44,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash -613859515, now seen corresponding path program 8 times [2021-11-07 00:59:44,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:44,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163383139] [2021-11-07 00:59:44,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:44,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:45,642 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:45,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163383139] [2021-11-07 00:59:45,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163383139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:45,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:45,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:45,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506753212] [2021-11-07 00:59:45,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:45,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:45,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:45,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:45,644 INFO L87 Difference]: Start difference. First operand 909 states and 1749 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:47,099 INFO L93 Difference]: Finished difference Result 983 states and 1872 transitions. [2021-11-07 00:59:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:59:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:47,100 INFO L225 Difference]: With dead ends: 983 [2021-11-07 00:59:47,100 INFO L226 Difference]: Without dead ends: 983 [2021-11-07 00:59:47,101 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2021-11-07 00:59:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-11-07 00:59:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 904. [2021-11-07 00:59:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 892 states have (on average 1.9495515695067265) internal successors, (1739), 903 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1739 transitions. [2021-11-07 00:59:47,116 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1739 transitions. Word has length 18 [2021-11-07 00:59:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:47,116 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1739 transitions. [2021-11-07 00:59:47,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1739 transitions. [2021-11-07 00:59:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:47,118 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:47,118 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:47,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 00:59:47,118 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:47,119 INFO L85 PathProgramCache]: Analyzing trace with hash -365457517, now seen corresponding path program 9 times [2021-11-07 00:59:47,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:47,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056156085] [2021-11-07 00:59:47,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:47,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:47,809 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:47,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056156085] [2021-11-07 00:59:47,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056156085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:47,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:47,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:47,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836453410] [2021-11-07 00:59:47,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:47,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:47,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:47,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:47,810 INFO L87 Difference]: Start difference. First operand 904 states and 1739 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:49,249 INFO L93 Difference]: Finished difference Result 1010 states and 1924 transitions. [2021-11-07 00:59:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:59:49,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:49,251 INFO L225 Difference]: With dead ends: 1010 [2021-11-07 00:59:49,251 INFO L226 Difference]: Without dead ends: 1010 [2021-11-07 00:59:49,251 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2021-11-07 00:59:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-11-07 00:59:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 899. [2021-11-07 00:59:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 887 states have (on average 1.9492671927846674) internal successors, (1729), 898 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1729 transitions. [2021-11-07 00:59:49,267 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1729 transitions. Word has length 18 [2021-11-07 00:59:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:49,267 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1729 transitions. [2021-11-07 00:59:49,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1729 transitions. [2021-11-07 00:59:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:49,268 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:49,268 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:49,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 00:59:49,269 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1214456615, now seen corresponding path program 10 times [2021-11-07 00:59:49,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:49,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164167954] [2021-11-07 00:59:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:49,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:50,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:50,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164167954] [2021-11-07 00:59:50,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164167954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:50,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:50,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:50,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194085321] [2021-11-07 00:59:50,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:50,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:50,034 INFO L87 Difference]: Start difference. First operand 899 states and 1729 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:51,561 INFO L93 Difference]: Finished difference Result 970 states and 1857 transitions. [2021-11-07 00:59:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 00:59:51,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:51,562 INFO L225 Difference]: With dead ends: 970 [2021-11-07 00:59:51,562 INFO L226 Difference]: Without dead ends: 970 [2021-11-07 00:59:51,562 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=593, Unknown=0, NotChecked=0, Total=870 [2021-11-07 00:59:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-11-07 00:59:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 908. [2021-11-07 00:59:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 896 states have (on average 1.9497767857142858) internal successors, (1747), 907 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1747 transitions. [2021-11-07 00:59:51,575 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1747 transitions. Word has length 18 [2021-11-07 00:59:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:51,576 INFO L470 AbstractCegarLoop]: Abstraction has 908 states and 1747 transitions. [2021-11-07 00:59:51,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1747 transitions. [2021-11-07 00:59:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:51,576 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:51,577 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:51,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 00:59:51,577 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:51,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1626232793, now seen corresponding path program 11 times [2021-11-07 00:59:51,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:51,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346777700] [2021-11-07 00:59:51,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:51,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:52,165 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:52,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346777700] [2021-11-07 00:59:52,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346777700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:52,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:52,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:52,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479961017] [2021-11-07 00:59:52,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:52,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:52,167 INFO L87 Difference]: Start difference. First operand 908 states and 1747 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:53,233 INFO L93 Difference]: Finished difference Result 1202 states and 2308 transitions. [2021-11-07 00:59:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 00:59:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:53,236 INFO L225 Difference]: With dead ends: 1202 [2021-11-07 00:59:53,236 INFO L226 Difference]: Without dead ends: 1202 [2021-11-07 00:59:53,236 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-11-07 00:59:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-11-07 00:59:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 928. [2021-11-07 00:59:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 916 states have (on average 1.9508733624454149) internal successors, (1787), 927 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1787 transitions. [2021-11-07 00:59:53,253 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1787 transitions. Word has length 18 [2021-11-07 00:59:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:53,254 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 1787 transitions. [2021-11-07 00:59:53,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1787 transitions. [2021-11-07 00:59:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:53,255 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:53,255 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:53,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 00:59:53,256 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1640614697, now seen corresponding path program 12 times [2021-11-07 00:59:53,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:53,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819678245] [2021-11-07 00:59:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:53,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:54,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:54,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819678245] [2021-11-07 00:59:54,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819678245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:54,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:54,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:54,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606990370] [2021-11-07 00:59:54,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:54,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:54,303 INFO L87 Difference]: Start difference. First operand 928 states and 1787 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:55,713 INFO L93 Difference]: Finished difference Result 1225 states and 2352 transitions. [2021-11-07 00:59:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:59:55,714 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:55,715 INFO L225 Difference]: With dead ends: 1225 [2021-11-07 00:59:55,715 INFO L226 Difference]: Without dead ends: 1225 [2021-11-07 00:59:55,715 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2021-11-07 00:59:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2021-11-07 00:59:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 923. [2021-11-07 00:59:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 911 states have (on average 1.9506037321624587) internal successors, (1777), 922 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1777 transitions. [2021-11-07 00:59:55,729 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1777 transitions. Word has length 18 [2021-11-07 00:59:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:55,729 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1777 transitions. [2021-11-07 00:59:55,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1777 transitions. [2021-11-07 00:59:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:55,730 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:55,730 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:55,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-07 00:59:55,731 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1889016695, now seen corresponding path program 13 times [2021-11-07 00:59:55,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:55,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324925510] [2021-11-07 00:59:55,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:55,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:56,497 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:56,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324925510] [2021-11-07 00:59:56,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324925510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:56,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:56,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:56,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972117712] [2021-11-07 00:59:56,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:56,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:56,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:56,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:56,499 INFO L87 Difference]: Start difference. First operand 923 states and 1777 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:57,982 INFO L93 Difference]: Finished difference Result 1252 states and 2404 transitions. [2021-11-07 00:59:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:59:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 00:59:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:57,984 INFO L225 Difference]: With dead ends: 1252 [2021-11-07 00:59:57,984 INFO L226 Difference]: Without dead ends: 1252 [2021-11-07 00:59:57,985 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2021-11-07 00:59:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2021-11-07 00:59:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 918. [2021-11-07 00:59:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 906 states have (on average 1.9503311258278146) internal successors, (1767), 917 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:59:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1767 transitions. [2021-11-07 00:59:58,000 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1767 transitions. Word has length 18 [2021-11-07 00:59:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:58,000 INFO L470 AbstractCegarLoop]: Abstraction has 918 states and 1767 transitions. [2021-11-07 00:59:58,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 00:59:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1767 transitions. [2021-11-07 00:59:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 00:59:58,001 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:58,001 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:58,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-07 00:59:58,002 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 00:59:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash -826036469, now seen corresponding path program 14 times [2021-11-07 00:59:58,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:58,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760424516] [2021-11-07 00:59:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:58,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:59:58,725 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:58,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760424516] [2021-11-07 00:59:58,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760424516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:59:58,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:59:58,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 00:59:58,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102841934] [2021-11-07 00:59:58,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 00:59:58,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 00:59:58,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 00:59:58,728 INFO L87 Difference]: Start difference. First operand 918 states and 1767 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:00,098 INFO L93 Difference]: Finished difference Result 1268 states and 2446 transitions. [2021-11-07 01:00:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:00:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:00,099 INFO L225 Difference]: With dead ends: 1268 [2021-11-07 01:00:00,099 INFO L226 Difference]: Without dead ends: 1268 [2021-11-07 01:00:00,100 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:00:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2021-11-07 01:00:00,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 913. [2021-11-07 01:00:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 901 states have (on average 1.9500554938956716) internal successors, (1757), 912 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1757 transitions. [2021-11-07 01:00:00,112 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1757 transitions. Word has length 18 [2021-11-07 01:00:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:00,112 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1757 transitions. [2021-11-07 01:00:00,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1757 transitions. [2021-11-07 01:00:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:00,114 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:00,114 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:00,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-07 01:00:00,114 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1467305115, now seen corresponding path program 15 times [2021-11-07 01:00:00,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:00,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70409726] [2021-11-07 01:00:00,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:00,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:00,365 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:00,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70409726] [2021-11-07 01:00:00,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70409726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:00,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:00,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:00,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553821971] [2021-11-07 01:00:00,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:00,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:00,367 INFO L87 Difference]: Start difference. First operand 913 states and 1757 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:01,471 INFO L93 Difference]: Finished difference Result 1672 states and 3190 transitions. [2021-11-07 01:00:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 01:00:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:01,473 INFO L225 Difference]: With dead ends: 1672 [2021-11-07 01:00:01,473 INFO L226 Difference]: Without dead ends: 1672 [2021-11-07 01:00:01,473 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2021-11-07 01:00:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2021-11-07 01:00:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 921. [2021-11-07 01:00:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 909 states have (on average 1.9504950495049505) internal successors, (1773), 920 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1773 transitions. [2021-11-07 01:00:01,486 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1773 transitions. Word has length 18 [2021-11-07 01:00:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:01,486 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1773 transitions. [2021-11-07 01:00:01,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1773 transitions. [2021-11-07 01:00:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:01,488 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:01,488 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:01,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-07 01:00:01,490 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1528095320, now seen corresponding path program 1 times [2021-11-07 01:00:01,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:01,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882475383] [2021-11-07 01:00:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:01,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:01,689 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:01,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882475383] [2021-11-07 01:00:01,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882475383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:01,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:01,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:01,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444350721] [2021-11-07 01:00:01,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:01,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:01,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:01,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:01,691 INFO L87 Difference]: Start difference. First operand 921 states and 1773 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:03,593 INFO L93 Difference]: Finished difference Result 1717 states and 3232 transitions. [2021-11-07 01:00:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-07 01:00:03,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:03,596 INFO L225 Difference]: With dead ends: 1717 [2021-11-07 01:00:03,596 INFO L226 Difference]: Without dead ends: 1717 [2021-11-07 01:00:03,597 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 01:00:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2021-11-07 01:00:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 981. [2021-11-07 01:00:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 969 states have (on average 1.9535603715170278) internal successors, (1893), 980 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1893 transitions. [2021-11-07 01:00:03,612 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1893 transitions. Word has length 18 [2021-11-07 01:00:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:03,613 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1893 transitions. [2021-11-07 01:00:03,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1893 transitions. [2021-11-07 01:00:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:03,614 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:03,614 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:03,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-07 01:00:03,614 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:03,615 INFO L85 PathProgramCache]: Analyzing trace with hash -966753685, now seen corresponding path program 16 times [2021-11-07 01:00:03,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:03,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308526058] [2021-11-07 01:00:03,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:03,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:04,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:04,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308526058] [2021-11-07 01:00:04,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308526058] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:04,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:04,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:04,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749273406] [2021-11-07 01:00:04,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:04,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:04,368 INFO L87 Difference]: Start difference. First operand 981 states and 1893 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:05,288 INFO L93 Difference]: Finished difference Result 1498 states and 2905 transitions. [2021-11-07 01:00:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:00:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:05,289 INFO L225 Difference]: With dead ends: 1498 [2021-11-07 01:00:05,290 INFO L226 Difference]: Without dead ends: 1498 [2021-11-07 01:00:05,290 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:00:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2021-11-07 01:00:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1017. [2021-11-07 01:00:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1005 states have (on average 1.955223880597015) internal successors, (1965), 1016 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1965 transitions. [2021-11-07 01:00:05,315 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1965 transitions. Word has length 18 [2021-11-07 01:00:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:05,315 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 1965 transitions. [2021-11-07 01:00:05,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1965 transitions. [2021-11-07 01:00:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:05,316 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:05,316 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:05,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-07 01:00:05,317 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:05,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -952371781, now seen corresponding path program 17 times [2021-11-07 01:00:05,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:05,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696971360] [2021-11-07 01:00:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:05,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:05,864 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:05,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696971360] [2021-11-07 01:00:05,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696971360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:05,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:05,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:05,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118392183] [2021-11-07 01:00:05,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:05,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:05,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:05,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:05,865 INFO L87 Difference]: Start difference. First operand 1017 states and 1965 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:07,040 INFO L93 Difference]: Finished difference Result 1521 states and 2949 transitions. [2021-11-07 01:00:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:00:07,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:07,042 INFO L225 Difference]: With dead ends: 1521 [2021-11-07 01:00:07,042 INFO L226 Difference]: Without dead ends: 1521 [2021-11-07 01:00:07,043 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:00:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2021-11-07 01:00:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1026. [2021-11-07 01:00:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1014 states have (on average 1.955621301775148) internal successors, (1983), 1025 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1983 transitions. [2021-11-07 01:00:07,056 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1983 transitions. Word has length 18 [2021-11-07 01:00:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:07,057 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1983 transitions. [2021-11-07 01:00:07,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1983 transitions. [2021-11-07 01:00:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:07,057 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:07,057 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:07,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-07 01:00:07,058 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash -703969783, now seen corresponding path program 18 times [2021-11-07 01:00:07,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:07,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971619309] [2021-11-07 01:00:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:07,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:07,679 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:07,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971619309] [2021-11-07 01:00:07,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971619309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:07,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:07,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:07,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122358959] [2021-11-07 01:00:07,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:07,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:07,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:07,680 INFO L87 Difference]: Start difference. First operand 1026 states and 1983 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:09,072 INFO L93 Difference]: Finished difference Result 1548 states and 3001 transitions. [2021-11-07 01:00:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:00:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:09,074 INFO L225 Difference]: With dead ends: 1548 [2021-11-07 01:00:09,074 INFO L226 Difference]: Without dead ends: 1548 [2021-11-07 01:00:09,074 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:00:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2021-11-07 01:00:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1035. [2021-11-07 01:00:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1023 states have (on average 1.9560117302052786) internal successors, (2001), 1034 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 2001 transitions. [2021-11-07 01:00:09,099 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 2001 transitions. Word has length 18 [2021-11-07 01:00:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:09,099 INFO L470 AbstractCegarLoop]: Abstraction has 1035 states and 2001 transitions. [2021-11-07 01:00:09,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 2001 transitions. [2021-11-07 01:00:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:09,100 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:09,100 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:09,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-07 01:00:09,101 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 875944349, now seen corresponding path program 19 times [2021-11-07 01:00:09,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:09,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101448467] [2021-11-07 01:00:09,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:09,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:09,741 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:09,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101448467] [2021-11-07 01:00:09,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101448467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:09,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:09,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:09,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431998990] [2021-11-07 01:00:09,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:09,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:09,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:09,743 INFO L87 Difference]: Start difference. First operand 1035 states and 2001 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:11,197 INFO L93 Difference]: Finished difference Result 1576 states and 3055 transitions. [2021-11-07 01:00:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:00:11,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:11,199 INFO L225 Difference]: With dead ends: 1576 [2021-11-07 01:00:11,199 INFO L226 Difference]: Without dead ends: 1576 [2021-11-07 01:00:11,200 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:00:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2021-11-07 01:00:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1044. [2021-11-07 01:00:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1032 states have (on average 1.9563953488372092) internal successors, (2019), 1043 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2019 transitions. [2021-11-07 01:00:11,213 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2019 transitions. Word has length 18 [2021-11-07 01:00:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:11,214 INFO L470 AbstractCegarLoop]: Abstraction has 1044 states and 2019 transitions. [2021-11-07 01:00:11,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2019 transitions. [2021-11-07 01:00:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:11,215 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:11,215 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:11,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-07 01:00:11,215 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1125681363, now seen corresponding path program 20 times [2021-11-07 01:00:11,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:11,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631950464] [2021-11-07 01:00:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:11,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:11,431 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:11,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631950464] [2021-11-07 01:00:11,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631950464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:11,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:11,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:11,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653213658] [2021-11-07 01:00:11,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:11,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:11,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:11,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:11,433 INFO L87 Difference]: Start difference. First operand 1044 states and 2019 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:12,274 INFO L93 Difference]: Finished difference Result 1817 states and 3497 transitions. [2021-11-07 01:00:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:00:12,274 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:12,276 INFO L225 Difference]: With dead ends: 1817 [2021-11-07 01:00:12,276 INFO L226 Difference]: Without dead ends: 1817 [2021-11-07 01:00:12,277 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:00:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2021-11-07 01:00:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1052. [2021-11-07 01:00:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1040 states have (on average 1.9567307692307692) internal successors, (2035), 1051 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2035 transitions. [2021-11-07 01:00:12,296 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2035 transitions. Word has length 18 [2021-11-07 01:00:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:12,296 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 2035 transitions. [2021-11-07 01:00:12,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2035 transitions. [2021-11-07 01:00:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:12,298 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:12,298 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:12,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-07 01:00:12,298 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash 173885498, now seen corresponding path program 2 times [2021-11-07 01:00:12,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:12,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618309910] [2021-11-07 01:00:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:12,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:12,452 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:12,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618309910] [2021-11-07 01:00:12,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618309910] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:12,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:12,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:12,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969288057] [2021-11-07 01:00:12,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:12,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:12,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:12,453 INFO L87 Difference]: Start difference. First operand 1052 states and 2035 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:14,592 INFO L93 Difference]: Finished difference Result 1937 states and 3689 transitions. [2021-11-07 01:00:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-07 01:00:14,592 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:14,595 INFO L225 Difference]: With dead ends: 1937 [2021-11-07 01:00:14,595 INFO L226 Difference]: Without dead ends: 1937 [2021-11-07 01:00:14,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:00:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2021-11-07 01:00:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 986. [2021-11-07 01:00:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 974 states have (on average 1.9537987679671458) internal successors, (1903), 985 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1903 transitions. [2021-11-07 01:00:14,610 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1903 transitions. Word has length 18 [2021-11-07 01:00:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:14,610 INFO L470 AbstractCegarLoop]: Abstraction has 986 states and 1903 transitions. [2021-11-07 01:00:14,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1903 transitions. [2021-11-07 01:00:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:14,611 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:14,611 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:14,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-07 01:00:14,611 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1388708505, now seen corresponding path program 21 times [2021-11-07 01:00:14,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:14,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407909585] [2021-11-07 01:00:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:14,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:14,822 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:14,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407909585] [2021-11-07 01:00:14,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407909585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:14,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:14,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:14,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131302881] [2021-11-07 01:00:14,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:14,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:14,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:14,824 INFO L87 Difference]: Start difference. First operand 986 states and 1903 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:15,579 INFO L93 Difference]: Finished difference Result 2127 states and 4069 transitions. [2021-11-07 01:00:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:00:15,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:15,582 INFO L225 Difference]: With dead ends: 2127 [2021-11-07 01:00:15,582 INFO L226 Difference]: Without dead ends: 2127 [2021-11-07 01:00:15,582 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:00:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2021-11-07 01:00:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1032. [2021-11-07 01:00:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1020 states have (on average 1.9558823529411764) internal successors, (1995), 1031 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1995 transitions. [2021-11-07 01:00:15,597 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1995 transitions. Word has length 18 [2021-11-07 01:00:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:15,597 INFO L470 AbstractCegarLoop]: Abstraction has 1032 states and 1995 transitions. [2021-11-07 01:00:15,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1995 transitions. [2021-11-07 01:00:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:15,598 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:15,598 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:15,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-07 01:00:15,598 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:15,599 INFO L85 PathProgramCache]: Analyzing trace with hash -89141644, now seen corresponding path program 3 times [2021-11-07 01:00:15,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:15,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787344195] [2021-11-07 01:00:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:15,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:15,757 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:15,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787344195] [2021-11-07 01:00:15,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787344195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:15,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:15,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:15,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207744024] [2021-11-07 01:00:15,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:15,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:15,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:15,759 INFO L87 Difference]: Start difference. First operand 1032 states and 1995 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:18,221 INFO L93 Difference]: Finished difference Result 2475 states and 4676 transitions. [2021-11-07 01:00:18,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-07 01:00:18,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:18,224 INFO L225 Difference]: With dead ends: 2475 [2021-11-07 01:00:18,224 INFO L226 Difference]: Without dead ends: 2475 [2021-11-07 01:00:18,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1321, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 01:00:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2021-11-07 01:00:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 992. [2021-11-07 01:00:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 980 states have (on average 1.9540816326530612) internal successors, (1915), 991 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1915 transitions. [2021-11-07 01:00:18,248 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1915 transitions. Word has length 18 [2021-11-07 01:00:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:18,248 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1915 transitions. [2021-11-07 01:00:18,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1915 transitions. [2021-11-07 01:00:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:18,249 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:18,250 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:18,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-07 01:00:18,250 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:18,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1621205323, now seen corresponding path program 22 times [2021-11-07 01:00:18,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:18,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763966838] [2021-11-07 01:00:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:18,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:19,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:19,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763966838] [2021-11-07 01:00:19,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763966838] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:19,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:19,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:19,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480961777] [2021-11-07 01:00:19,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:19,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:19,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:19,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:19,068 INFO L87 Difference]: Start difference. First operand 992 states and 1915 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:20,022 INFO L93 Difference]: Finished difference Result 1577 states and 3070 transitions. [2021-11-07 01:00:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:00:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:20,024 INFO L225 Difference]: With dead ends: 1577 [2021-11-07 01:00:20,024 INFO L226 Difference]: Without dead ends: 1577 [2021-11-07 01:00:20,024 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:00:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2021-11-07 01:00:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 998. [2021-11-07 01:00:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 986 states have (on average 1.9543610547667343) internal successors, (1927), 997 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1927 transitions. [2021-11-07 01:00:20,037 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1927 transitions. Word has length 18 [2021-11-07 01:00:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:20,037 INFO L470 AbstractCegarLoop]: Abstraction has 998 states and 1927 transitions. [2021-11-07 01:00:20,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1927 transitions. [2021-11-07 01:00:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:20,039 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:20,039 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:20,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-07 01:00:20,039 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1606823419, now seen corresponding path program 23 times [2021-11-07 01:00:20,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:20,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415012475] [2021-11-07 01:00:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:20,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:20,674 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:20,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415012475] [2021-11-07 01:00:20,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415012475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:20,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:20,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:20,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913765252] [2021-11-07 01:00:20,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:20,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:20,675 INFO L87 Difference]: Start difference. First operand 998 states and 1927 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:21,861 INFO L93 Difference]: Finished difference Result 1600 states and 3114 transitions. [2021-11-07 01:00:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:00:21,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:21,863 INFO L225 Difference]: With dead ends: 1600 [2021-11-07 01:00:21,863 INFO L226 Difference]: Without dead ends: 1600 [2021-11-07 01:00:21,864 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:00:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-11-07 01:00:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1007. [2021-11-07 01:00:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 995 states have (on average 1.9547738693467336) internal successors, (1945), 1006 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1945 transitions. [2021-11-07 01:00:21,885 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1945 transitions. Word has length 18 [2021-11-07 01:00:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:21,886 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 1945 transitions. [2021-11-07 01:00:21,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1945 transitions. [2021-11-07 01:00:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:21,887 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:21,887 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:21,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-07 01:00:21,888 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1358421421, now seen corresponding path program 24 times [2021-11-07 01:00:21,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:21,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694927656] [2021-11-07 01:00:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:21,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:22,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:22,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694927656] [2021-11-07 01:00:22,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694927656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:22,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:22,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:22,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44712689] [2021-11-07 01:00:22,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:22,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:22,531 INFO L87 Difference]: Start difference. First operand 1007 states and 1945 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:23,879 INFO L93 Difference]: Finished difference Result 1627 states and 3166 transitions. [2021-11-07 01:00:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:00:23,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:23,881 INFO L225 Difference]: With dead ends: 1627 [2021-11-07 01:00:23,881 INFO L226 Difference]: Without dead ends: 1627 [2021-11-07 01:00:23,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:00:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-11-07 01:00:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1016. [2021-11-07 01:00:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1004 states have (on average 1.955179282868526) internal successors, (1963), 1015 states have internal predecessors, (1963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1963 transitions. [2021-11-07 01:00:23,900 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1963 transitions. Word has length 18 [2021-11-07 01:00:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:23,901 INFO L470 AbstractCegarLoop]: Abstraction has 1016 states and 1963 transitions. [2021-11-07 01:00:23,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1963 transitions. [2021-11-07 01:00:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:23,902 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:23,902 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:23,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-07 01:00:23,903 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:23,903 INFO L85 PathProgramCache]: Analyzing trace with hash 221492711, now seen corresponding path program 25 times [2021-11-07 01:00:23,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:23,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668087084] [2021-11-07 01:00:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:23,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:24,507 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:24,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668087084] [2021-11-07 01:00:24,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668087084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:24,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:24,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:24,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16421531] [2021-11-07 01:00:24,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:24,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:24,508 INFO L87 Difference]: Start difference. First operand 1016 states and 1963 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:25,605 INFO L93 Difference]: Finished difference Result 1655 states and 3220 transitions. [2021-11-07 01:00:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:00:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:25,608 INFO L225 Difference]: With dead ends: 1655 [2021-11-07 01:00:25,608 INFO L226 Difference]: Without dead ends: 1655 [2021-11-07 01:00:25,608 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:00:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2021-11-07 01:00:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1025. [2021-11-07 01:00:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1013 states have (on average 1.9555774925962488) internal successors, (1981), 1024 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1981 transitions. [2021-11-07 01:00:25,623 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1981 transitions. Word has length 18 [2021-11-07 01:00:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:25,624 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1981 transitions. [2021-11-07 01:00:25,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1981 transitions. [2021-11-07 01:00:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:25,625 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:25,625 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:25,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-07 01:00:25,625 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1780133001, now seen corresponding path program 26 times [2021-11-07 01:00:25,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:25,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877306506] [2021-11-07 01:00:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:25,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:25,835 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:25,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877306506] [2021-11-07 01:00:25,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877306506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:25,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:25,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:25,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474388998] [2021-11-07 01:00:25,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:25,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:25,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:25,837 INFO L87 Difference]: Start difference. First operand 1025 states and 1981 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:26,770 INFO L93 Difference]: Finished difference Result 2026 states and 3909 transitions. [2021-11-07 01:00:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:00:26,770 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:26,772 INFO L225 Difference]: With dead ends: 2026 [2021-11-07 01:00:26,772 INFO L226 Difference]: Without dead ends: 2026 [2021-11-07 01:00:26,772 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:00:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2021-11-07 01:00:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1033. [2021-11-07 01:00:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1021 states have (on average 1.9559255631733594) internal successors, (1997), 1032 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1997 transitions. [2021-11-07 01:00:26,795 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1997 transitions. Word has length 18 [2021-11-07 01:00:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:26,795 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1997 transitions. [2021-11-07 01:00:26,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1997 transitions. [2021-11-07 01:00:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:26,796 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:26,797 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:26,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-07 01:00:26,797 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash -480566140, now seen corresponding path program 4 times [2021-11-07 01:00:26,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:26,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235033576] [2021-11-07 01:00:26,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:26,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:26,940 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:26,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235033576] [2021-11-07 01:00:26,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235033576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:26,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:26,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:26,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74971490] [2021-11-07 01:00:26,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:26,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:26,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:26,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:26,942 INFO L87 Difference]: Start difference. First operand 1033 states and 1997 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:28,715 INFO L93 Difference]: Finished difference Result 2146 states and 4101 transitions. [2021-11-07 01:00:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:00:28,715 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:28,717 INFO L225 Difference]: With dead ends: 2146 [2021-11-07 01:00:28,717 INFO L226 Difference]: Without dead ends: 2146 [2021-11-07 01:00:28,718 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:00:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2021-11-07 01:00:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 942. [2021-11-07 01:00:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 930 states have (on average 1.9516129032258065) internal successors, (1815), 941 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1815 transitions. [2021-11-07 01:00:28,734 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1815 transitions. Word has length 18 [2021-11-07 01:00:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:28,734 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1815 transitions. [2021-11-07 01:00:28,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1815 transitions. [2021-11-07 01:00:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:28,735 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:28,735 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:28,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-07 01:00:28,735 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2043160143, now seen corresponding path program 27 times [2021-11-07 01:00:28,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:28,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188880958] [2021-11-07 01:00:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:28,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:28,951 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:28,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188880958] [2021-11-07 01:00:28,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188880958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:28,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:28,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:28,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116255348] [2021-11-07 01:00:28,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:28,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:28,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:28,953 INFO L87 Difference]: Start difference. First operand 942 states and 1815 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:29,939 INFO L93 Difference]: Finished difference Result 2368 states and 4544 transitions. [2021-11-07 01:00:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:00:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:29,942 INFO L225 Difference]: With dead ends: 2368 [2021-11-07 01:00:29,942 INFO L226 Difference]: Without dead ends: 2368 [2021-11-07 01:00:29,943 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:00:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-11-07 01:00:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 988. [2021-11-07 01:00:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 976 states have (on average 1.9538934426229508) internal successors, (1907), 987 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1907 transitions. [2021-11-07 01:00:29,959 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1907 transitions. Word has length 18 [2021-11-07 01:00:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:29,959 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 1907 transitions. [2021-11-07 01:00:29,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1907 transitions. [2021-11-07 01:00:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:29,960 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:29,960 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:29,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-07 01:00:29,960 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -743593282, now seen corresponding path program 5 times [2021-11-07 01:00:29,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:29,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646347772] [2021-11-07 01:00:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:29,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:30,116 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:30,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646347772] [2021-11-07 01:00:30,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646347772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:30,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:30,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:30,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206397131] [2021-11-07 01:00:30,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:30,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:30,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:30,117 INFO L87 Difference]: Start difference. First operand 988 states and 1907 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:32,250 INFO L93 Difference]: Finished difference Result 2716 states and 5151 transitions. [2021-11-07 01:00:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 01:00:32,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:32,253 INFO L225 Difference]: With dead ends: 2716 [2021-11-07 01:00:32,253 INFO L226 Difference]: Without dead ends: 2716 [2021-11-07 01:00:32,253 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 01:00:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2021-11-07 01:00:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 937. [2021-11-07 01:00:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 925 states have (on average 1.9513513513513514) internal successors, (1805), 936 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1805 transitions. [2021-11-07 01:00:32,269 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1805 transitions. Word has length 18 [2021-11-07 01:00:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:32,269 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1805 transitions. [2021-11-07 01:00:32,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1805 transitions. [2021-11-07 01:00:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:32,270 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:32,270 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:32,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-07 01:00:32,271 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash 728611739, now seen corresponding path program 28 times [2021-11-07 01:00:32,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:32,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844600884] [2021-11-07 01:00:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:32,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:32,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:32,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844600884] [2021-11-07 01:00:32,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844600884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:32,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:32,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:32,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414434230] [2021-11-07 01:00:32,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:32,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:32,471 INFO L87 Difference]: Start difference. First operand 937 states and 1805 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:33,565 INFO L93 Difference]: Finished difference Result 1854 states and 3566 transitions. [2021-11-07 01:00:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 01:00:33,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:33,568 INFO L225 Difference]: With dead ends: 1854 [2021-11-07 01:00:33,568 INFO L226 Difference]: Without dead ends: 1854 [2021-11-07 01:00:33,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 01:00:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2021-11-07 01:00:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 894. [2021-11-07 01:00:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 884 states have (on average 1.9502262443438914) internal successors, (1724), 893 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1724 transitions. [2021-11-07 01:00:33,582 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1724 transitions. Word has length 18 [2021-11-07 01:00:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:33,582 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 1724 transitions. [2021-11-07 01:00:33,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1724 transitions. [2021-11-07 01:00:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:00:33,583 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:33,583 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:33,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-07 01:00:33,583 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2028178600, now seen corresponding path program 6 times [2021-11-07 01:00:33,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:33,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834786379] [2021-11-07 01:00:33,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:33,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:33,737 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:33,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834786379] [2021-11-07 01:00:33,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834786379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:33,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:33,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:33,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33403845] [2021-11-07 01:00:33,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:33,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:33,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:33,739 INFO L87 Difference]: Start difference. First operand 894 states and 1724 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:36,016 INFO L93 Difference]: Finished difference Result 2120 states and 4048 transitions. [2021-11-07 01:00:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 01:00:36,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 18 [2021-11-07 01:00:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:36,018 INFO L225 Difference]: With dead ends: 2120 [2021-11-07 01:00:36,018 INFO L226 Difference]: Without dead ends: 2120 [2021-11-07 01:00:36,019 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 01:00:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2021-11-07 01:00:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 714. [2021-11-07 01:00:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 705 states have (on average 1.9347517730496453) internal successors, (1364), 713 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1364 transitions. [2021-11-07 01:00:36,031 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1364 transitions. Word has length 18 [2021-11-07 01:00:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:36,031 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 1364 transitions. [2021-11-07 01:00:36,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2021-11-07 01:00:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1364 transitions. [2021-11-07 01:00:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:36,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:36,031 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:36,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-07 01:00:36,032 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash 524630834, now seen corresponding path program 1 times [2021-11-07 01:00:36,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:36,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322017178] [2021-11-07 01:00:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:36,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:36,707 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:36,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322017178] [2021-11-07 01:00:36,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322017178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:36,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:36,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:36,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279147379] [2021-11-07 01:00:36,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:36,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:36,709 INFO L87 Difference]: Start difference. First operand 714 states and 1364 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:38,001 INFO L93 Difference]: Finished difference Result 1007 states and 1943 transitions. [2021-11-07 01:00:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:00:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:38,003 INFO L225 Difference]: With dead ends: 1007 [2021-11-07 01:00:38,003 INFO L226 Difference]: Without dead ends: 1007 [2021-11-07 01:00:38,003 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:00:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-11-07 01:00:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 759. [2021-11-07 01:00:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 750 states have (on average 1.9386666666666668) internal successors, (1454), 758 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1454 transitions. [2021-11-07 01:00:38,015 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1454 transitions. Word has length 24 [2021-11-07 01:00:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:38,016 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 1454 transitions. [2021-11-07 01:00:38,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1454 transitions. [2021-11-07 01:00:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:38,017 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:38,017 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:38,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-07 01:00:38,018 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 526119764, now seen corresponding path program 2 times [2021-11-07 01:00:38,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:38,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228638223] [2021-11-07 01:00:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:38,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:38,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:38,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228638223] [2021-11-07 01:00:38,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228638223] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:38,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:38,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:38,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556149157] [2021-11-07 01:00:38,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:38,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:38,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:38,909 INFO L87 Difference]: Start difference. First operand 759 states and 1454 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:40,483 INFO L93 Difference]: Finished difference Result 1049 states and 2027 transitions. [2021-11-07 01:00:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:00:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:40,484 INFO L225 Difference]: With dead ends: 1049 [2021-11-07 01:00:40,485 INFO L226 Difference]: Without dead ends: 1049 [2021-11-07 01:00:40,485 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:00:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-11-07 01:00:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 763. [2021-11-07 01:00:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 754 states have (on average 1.9389920424403182) internal successors, (1462), 762 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1462 transitions. [2021-11-07 01:00:40,494 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1462 transitions. Word has length 24 [2021-11-07 01:00:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:40,494 INFO L470 AbstractCegarLoop]: Abstraction has 763 states and 1462 transitions. [2021-11-07 01:00:40,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1462 transitions. [2021-11-07 01:00:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:40,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:40,495 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:40,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-07 01:00:40,495 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1076366956, now seen corresponding path program 3 times [2021-11-07 01:00:40,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:40,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430548691] [2021-11-07 01:00:40,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:40,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:41,233 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:41,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430548691] [2021-11-07 01:00:41,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430548691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:41,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:41,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:41,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583177727] [2021-11-07 01:00:41,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:41,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:41,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:41,236 INFO L87 Difference]: Start difference. First operand 763 states and 1462 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:42,082 INFO L93 Difference]: Finished difference Result 1024 states and 1977 transitions. [2021-11-07 01:00:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:00:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:42,084 INFO L225 Difference]: With dead ends: 1024 [2021-11-07 01:00:42,084 INFO L226 Difference]: Without dead ends: 1024 [2021-11-07 01:00:42,084 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:00:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-11-07 01:00:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 779. [2021-11-07 01:00:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 770 states have (on average 1.9402597402597404) internal successors, (1494), 778 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1494 transitions. [2021-11-07 01:00:42,093 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1494 transitions. Word has length 24 [2021-11-07 01:00:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:42,094 INFO L470 AbstractCegarLoop]: Abstraction has 779 states and 1494 transitions. [2021-11-07 01:00:42,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1494 transitions. [2021-11-07 01:00:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:42,095 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:42,095 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:42,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-07 01:00:42,095 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1030786726, now seen corresponding path program 4 times [2021-11-07 01:00:42,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:42,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777159890] [2021-11-07 01:00:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:42,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:42,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:42,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777159890] [2021-11-07 01:00:42,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777159890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:42,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:42,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:42,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095881972] [2021-11-07 01:00:42,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:42,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:42,943 INFO L87 Difference]: Start difference. First operand 779 states and 1494 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:44,473 INFO L93 Difference]: Finished difference Result 1049 states and 2027 transitions. [2021-11-07 01:00:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:00:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:44,475 INFO L225 Difference]: With dead ends: 1049 [2021-11-07 01:00:44,475 INFO L226 Difference]: Without dead ends: 1049 [2021-11-07 01:00:44,475 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:00:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-11-07 01:00:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 788. [2021-11-07 01:00:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 779 states have (on average 1.9409499358151476) internal successors, (1512), 787 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1512 transitions. [2021-11-07 01:00:44,484 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1512 transitions. Word has length 24 [2021-11-07 01:00:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:44,485 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 1512 transitions. [2021-11-07 01:00:44,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1512 transitions. [2021-11-07 01:00:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:44,485 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:44,485 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:44,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-07 01:00:44,486 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1027230406, now seen corresponding path program 5 times [2021-11-07 01:00:44,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:44,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739108481] [2021-11-07 01:00:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:44,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:45,213 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:45,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739108481] [2021-11-07 01:00:45,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739108481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:45,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:45,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:45,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717727686] [2021-11-07 01:00:45,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:45,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:45,216 INFO L87 Difference]: Start difference. First operand 788 states and 1512 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:46,132 INFO L93 Difference]: Finished difference Result 1035 states and 1999 transitions. [2021-11-07 01:00:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:00:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:46,133 INFO L225 Difference]: With dead ends: 1035 [2021-11-07 01:00:46,133 INFO L226 Difference]: Without dead ends: 1035 [2021-11-07 01:00:46,133 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:00:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2021-11-07 01:00:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 795. [2021-11-07 01:00:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 786 states have (on average 1.9414758269720103) internal successors, (1526), 794 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1526 transitions. [2021-11-07 01:00:46,142 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1526 transitions. Word has length 24 [2021-11-07 01:00:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:46,142 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1526 transitions. [2021-11-07 01:00:46,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1526 transitions. [2021-11-07 01:00:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:46,143 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:46,143 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:46,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-07 01:00:46,144 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:46,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:46,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1651029618, now seen corresponding path program 6 times [2021-11-07 01:00:46,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:46,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628964544] [2021-11-07 01:00:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:46,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:47,074 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:47,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628964544] [2021-11-07 01:00:47,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628964544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:47,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:47,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:47,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893729344] [2021-11-07 01:00:47,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:47,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:47,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:47,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:47,077 INFO L87 Difference]: Start difference. First operand 795 states and 1526 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:47,784 INFO L93 Difference]: Finished difference Result 1028 states and 1985 transitions. [2021-11-07 01:00:47,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:00:47,784 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:47,785 INFO L225 Difference]: With dead ends: 1028 [2021-11-07 01:00:47,785 INFO L226 Difference]: Without dead ends: 1028 [2021-11-07 01:00:47,785 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:00:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-07 01:00:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 794. [2021-11-07 01:00:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 785 states have (on average 1.9414012738853503) internal successors, (1524), 793 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1524 transitions. [2021-11-07 01:00:47,797 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1524 transitions. Word has length 24 [2021-11-07 01:00:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:47,797 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1524 transitions. [2021-11-07 01:00:47,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1524 transitions. [2021-11-07 01:00:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:47,799 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:47,799 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:47,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-07 01:00:47,799 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 170093596, now seen corresponding path program 7 times [2021-11-07 01:00:47,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:47,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955291087] [2021-11-07 01:00:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:47,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:48,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:48,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955291087] [2021-11-07 01:00:48,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955291087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:48,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:48,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:48,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469102557] [2021-11-07 01:00:48,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:48,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:48,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:48,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:48,245 INFO L87 Difference]: Start difference. First operand 794 states and 1524 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:50,008 INFO L93 Difference]: Finished difference Result 1062 states and 2034 transitions. [2021-11-07 01:00:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-07 01:00:50,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:50,009 INFO L225 Difference]: With dead ends: 1062 [2021-11-07 01:00:50,009 INFO L226 Difference]: Without dead ends: 1062 [2021-11-07 01:00:50,010 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=859, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 01:00:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2021-11-07 01:00:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 801. [2021-11-07 01:00:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 792 states have (on average 1.9419191919191918) internal successors, (1538), 800 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1538 transitions. [2021-11-07 01:00:50,019 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1538 transitions. Word has length 24 [2021-11-07 01:00:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:50,020 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1538 transitions. [2021-11-07 01:00:50,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1538 transitions. [2021-11-07 01:00:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:50,020 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:50,020 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:50,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-07 01:00:50,021 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 213886366, now seen corresponding path program 8 times [2021-11-07 01:00:50,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:50,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458674633] [2021-11-07 01:00:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:50,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:50,333 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:50,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458674633] [2021-11-07 01:00:50,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458674633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:50,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:50,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:50,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095168451] [2021-11-07 01:00:50,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:50,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:50,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:50,335 INFO L87 Difference]: Start difference. First operand 801 states and 1538 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:51,440 INFO L93 Difference]: Finished difference Result 1081 states and 2072 transitions. [2021-11-07 01:00:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 01:00:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:51,442 INFO L225 Difference]: With dead ends: 1081 [2021-11-07 01:00:51,442 INFO L226 Difference]: Without dead ends: 1081 [2021-11-07 01:00:51,442 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=638, Unknown=0, NotChecked=0, Total=930 [2021-11-07 01:00:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-11-07 01:00:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 805. [2021-11-07 01:00:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 796 states have (on average 1.9422110552763818) internal successors, (1546), 804 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1546 transitions. [2021-11-07 01:00:51,451 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1546 transitions. Word has length 24 [2021-11-07 01:00:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:51,452 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1546 transitions. [2021-11-07 01:00:51,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1546 transitions. [2021-11-07 01:00:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:51,452 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:51,452 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:51,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-07 01:00:51,453 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash 215375296, now seen corresponding path program 9 times [2021-11-07 01:00:51,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:51,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252369831] [2021-11-07 01:00:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:51,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:52,098 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:52,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252369831] [2021-11-07 01:00:52,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252369831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:52,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:52,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:52,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517433957] [2021-11-07 01:00:52,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:52,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:52,100 INFO L87 Difference]: Start difference. First operand 805 states and 1546 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:53,333 INFO L93 Difference]: Finished difference Result 1084 states and 2078 transitions. [2021-11-07 01:00:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:00:53,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:53,335 INFO L225 Difference]: With dead ends: 1084 [2021-11-07 01:00:53,335 INFO L226 Difference]: Without dead ends: 1084 [2021-11-07 01:00:53,335 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:00:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-11-07 01:00:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 805. [2021-11-07 01:00:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 796 states have (on average 1.9422110552763818) internal successors, (1546), 804 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1546 transitions. [2021-11-07 01:00:53,349 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1546 transitions. Word has length 24 [2021-11-07 01:00:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:53,349 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1546 transitions. [2021-11-07 01:00:53,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1546 transitions. [2021-11-07 01:00:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:53,350 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:53,350 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:53,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-07 01:00:53,350 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash -605517120, now seen corresponding path program 10 times [2021-11-07 01:00:53,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:53,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718432949] [2021-11-07 01:00:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:53,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:54,340 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:54,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718432949] [2021-11-07 01:00:54,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718432949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:54,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:54,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:54,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632236570] [2021-11-07 01:00:54,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:54,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:54,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:54,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:54,342 INFO L87 Difference]: Start difference. First operand 805 states and 1546 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:55,104 INFO L93 Difference]: Finished difference Result 1050 states and 2029 transitions. [2021-11-07 01:00:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:00:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:55,106 INFO L225 Difference]: With dead ends: 1050 [2021-11-07 01:00:55,106 INFO L226 Difference]: Without dead ends: 1050 [2021-11-07 01:00:55,106 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:00:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-11-07 01:00:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 809. [2021-11-07 01:00:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 800 states have (on average 1.9425) internal successors, (1554), 808 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1554 transitions. [2021-11-07 01:00:55,115 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1554 transitions. Word has length 24 [2021-11-07 01:00:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:55,116 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 1554 transitions. [2021-11-07 01:00:55,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1554 transitions. [2021-11-07 01:00:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:55,116 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:55,116 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:55,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-07 01:00:55,117 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:55,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1566611174, now seen corresponding path program 11 times [2021-11-07 01:00:55,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:55,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51196572] [2021-11-07 01:00:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:55,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:56,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:56,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51196572] [2021-11-07 01:00:56,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51196572] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:56,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:56,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:56,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501590056] [2021-11-07 01:00:56,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:56,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:56,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:56,309 INFO L87 Difference]: Start difference. First operand 809 states and 1554 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:57,878 INFO L93 Difference]: Finished difference Result 1087 states and 2103 transitions. [2021-11-07 01:00:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:00:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:57,880 INFO L225 Difference]: With dead ends: 1087 [2021-11-07 01:00:57,880 INFO L226 Difference]: Without dead ends: 1087 [2021-11-07 01:00:57,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:00:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-11-07 01:00:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 810. [2021-11-07 01:00:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 801 states have (on average 1.9425717852684146) internal successors, (1556), 809 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1556 transitions. [2021-11-07 01:00:57,902 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1556 transitions. Word has length 24 [2021-11-07 01:00:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:57,902 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1556 transitions. [2021-11-07 01:00:57,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1556 transitions. [2021-11-07 01:00:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:57,903 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:57,903 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:57,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-07 01:00:57,903 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1563054854, now seen corresponding path program 12 times [2021-11-07 01:00:57,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:57,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194761892] [2021-11-07 01:00:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:57,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:58,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:58,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194761892] [2021-11-07 01:00:58,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194761892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:58,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:58,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:00:58,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636411751] [2021-11-07 01:00:58,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:00:58,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:00:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:58,963 INFO L87 Difference]: Start difference. First operand 810 states and 1556 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:59,783 INFO L93 Difference]: Finished difference Result 1056 states and 2041 transitions. [2021-11-07 01:00:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:00:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:00:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:59,784 INFO L225 Difference]: With dead ends: 1056 [2021-11-07 01:00:59,784 INFO L226 Difference]: Without dead ends: 1056 [2021-11-07 01:00:59,785 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:00:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2021-11-07 01:00:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 808. [2021-11-07 01:00:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 799 states have (on average 1.9424280350438048) internal successors, (1552), 807 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:00:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1552 transitions. [2021-11-07 01:00:59,795 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1552 transitions. Word has length 24 [2021-11-07 01:00:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:59,796 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1552 transitions. [2021-11-07 01:00:59,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:00:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1552 transitions. [2021-11-07 01:00:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:00:59,796 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:59,797 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:59,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-07 01:00:59,797 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:00:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1110703450, now seen corresponding path program 13 times [2021-11-07 01:00:59,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:59,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751907131] [2021-11-07 01:00:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:59,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:00,321 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:00,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751907131] [2021-11-07 01:01:00,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751907131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:00,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:00,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:00,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573901835] [2021-11-07 01:01:00,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:00,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:00,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:00,323 INFO L87 Difference]: Start difference. First operand 808 states and 1552 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:01,496 INFO L93 Difference]: Finished difference Result 1093 states and 2096 transitions. [2021-11-07 01:01:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:01:01,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:01,498 INFO L225 Difference]: With dead ends: 1093 [2021-11-07 01:01:01,498 INFO L226 Difference]: Without dead ends: 1093 [2021-11-07 01:01:01,498 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:01:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-11-07 01:01:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 802. [2021-11-07 01:01:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 793 states have (on average 1.9419924337957124) internal successors, (1540), 801 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1540 transitions. [2021-11-07 01:01:01,508 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1540 transitions. Word has length 24 [2021-11-07 01:01:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:01,509 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1540 transitions. [2021-11-07 01:01:01,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1540 transitions. [2021-11-07 01:01:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:01,510 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:01,510 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:01,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-07 01:01:01,510 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash -57158438, now seen corresponding path program 14 times [2021-11-07 01:01:01,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:01,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927976706] [2021-11-07 01:01:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:01,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:02,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:02,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927976706] [2021-11-07 01:01:02,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927976706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:02,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:02,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:02,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788576161] [2021-11-07 01:01:02,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:02,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:02,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:02,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:02,409 INFO L87 Difference]: Start difference. First operand 802 states and 1540 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:03,449 INFO L93 Difference]: Finished difference Result 1067 states and 2044 transitions. [2021-11-07 01:01:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:01:03,450 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:03,451 INFO L225 Difference]: With dead ends: 1067 [2021-11-07 01:01:03,451 INFO L226 Difference]: Without dead ends: 1067 [2021-11-07 01:01:03,451 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:01:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2021-11-07 01:01:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 809. [2021-11-07 01:01:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 800 states have (on average 1.9425) internal successors, (1554), 808 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1554 transitions. [2021-11-07 01:01:03,466 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1554 transitions. Word has length 24 [2021-11-07 01:01:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:03,466 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 1554 transitions. [2021-11-07 01:01:03,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1554 transitions. [2021-11-07 01:01:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:03,466 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:03,467 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:03,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-07 01:01:03,467 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1018252492, now seen corresponding path program 15 times [2021-11-07 01:01:03,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:03,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415829118] [2021-11-07 01:01:03,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:03,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:04,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:04,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415829118] [2021-11-07 01:01:04,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415829118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:04,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:04,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:04,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206666633] [2021-11-07 01:01:04,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:04,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:04,273 INFO L87 Difference]: Start difference. First operand 809 states and 1554 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:05,603 INFO L93 Difference]: Finished difference Result 1070 states and 2050 transitions. [2021-11-07 01:01:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:01:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:05,605 INFO L225 Difference]: With dead ends: 1070 [2021-11-07 01:01:05,605 INFO L226 Difference]: Without dead ends: 1070 [2021-11-07 01:01:05,605 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:01:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2021-11-07 01:01:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 784. [2021-11-07 01:01:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 775 states have (on average 1.9406451612903226) internal successors, (1504), 783 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1504 transitions. [2021-11-07 01:01:05,616 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1504 transitions. Word has length 24 [2021-11-07 01:01:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:05,616 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 1504 transitions. [2021-11-07 01:01:05,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1504 transitions. [2021-11-07 01:01:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:05,617 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:05,617 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:05,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-07 01:01:05,617 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 946593256, now seen corresponding path program 16 times [2021-11-07 01:01:05,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:05,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097060599] [2021-11-07 01:01:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:05,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:05,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:05,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097060599] [2021-11-07 01:01:05,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097060599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:05,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:05,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:05,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183567337] [2021-11-07 01:01:05,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:05,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:05,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:05,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:05,930 INFO L87 Difference]: Start difference. First operand 784 states and 1504 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:07,499 INFO L93 Difference]: Finished difference Result 1466 states and 2810 transitions. [2021-11-07 01:01:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 01:01:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:07,501 INFO L225 Difference]: With dead ends: 1466 [2021-11-07 01:01:07,501 INFO L226 Difference]: Without dead ends: 1466 [2021-11-07 01:01:07,501 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:01:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2021-11-07 01:01:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 803. [2021-11-07 01:01:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 794 states have (on average 1.942065491183879) internal successors, (1542), 802 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1542 transitions. [2021-11-07 01:01:07,513 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1542 transitions. Word has length 24 [2021-11-07 01:01:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:07,513 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1542 transitions. [2021-11-07 01:01:07,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1542 transitions. [2021-11-07 01:01:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:07,514 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:07,514 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:07,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-07 01:01:07,514 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash 990386026, now seen corresponding path program 17 times [2021-11-07 01:01:07,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:07,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590367988] [2021-11-07 01:01:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:07,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:07,823 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:07,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590367988] [2021-11-07 01:01:07,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590367988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:07,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:07,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:07,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231208129] [2021-11-07 01:01:07,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:07,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:07,825 INFO L87 Difference]: Start difference. First operand 803 states and 1542 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:09,149 INFO L93 Difference]: Finished difference Result 1387 states and 2652 transitions. [2021-11-07 01:01:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 01:01:09,149 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:09,150 INFO L225 Difference]: With dead ends: 1387 [2021-11-07 01:01:09,151 INFO L226 Difference]: Without dead ends: 1387 [2021-11-07 01:01:09,151 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:01:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2021-11-07 01:01:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 802. [2021-11-07 01:01:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 793 states have (on average 1.9419924337957124) internal successors, (1540), 801 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1540 transitions. [2021-11-07 01:01:09,162 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1540 transitions. Word has length 24 [2021-11-07 01:01:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:09,162 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1540 transitions. [2021-11-07 01:01:09,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1540 transitions. [2021-11-07 01:01:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:09,163 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:09,163 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:09,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-07 01:01:09,163 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:09,164 INFO L85 PathProgramCache]: Analyzing trace with hash 991874956, now seen corresponding path program 18 times [2021-11-07 01:01:09,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:09,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763695316] [2021-11-07 01:01:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:09,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:09,738 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:09,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763695316] [2021-11-07 01:01:09,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763695316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:09,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:09,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:09,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216850852] [2021-11-07 01:01:09,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:09,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:09,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:09,740 INFO L87 Difference]: Start difference. First operand 802 states and 1540 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:11,314 INFO L93 Difference]: Finished difference Result 1373 states and 2624 transitions. [2021-11-07 01:01:11,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 01:01:11,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:11,316 INFO L225 Difference]: With dead ends: 1373 [2021-11-07 01:01:11,317 INFO L226 Difference]: Without dead ends: 1373 [2021-11-07 01:01:11,317 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:01:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-11-07 01:01:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 798. [2021-11-07 01:01:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 789 states have (on average 1.9416983523447402) internal successors, (1532), 797 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1532 transitions. [2021-11-07 01:01:11,329 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1532 transitions. Word has length 24 [2021-11-07 01:01:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:11,329 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1532 transitions. [2021-11-07 01:01:11,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1532 transitions. [2021-11-07 01:01:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:11,331 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:11,331 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:11,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-07 01:01:11,331 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:11,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash -616125498, now seen corresponding path program 19 times [2021-11-07 01:01:11,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:11,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470973711] [2021-11-07 01:01:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:11,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:11,983 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:11,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470973711] [2021-11-07 01:01:11,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470973711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:11,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:11,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:11,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958838441] [2021-11-07 01:01:11,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:11,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:11,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:11,984 INFO L87 Difference]: Start difference. First operand 798 states and 1532 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:14,119 INFO L93 Difference]: Finished difference Result 854 states and 1644 transitions. [2021-11-07 01:01:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:01:14,119 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:14,120 INFO L225 Difference]: With dead ends: 854 [2021-11-07 01:01:14,120 INFO L226 Difference]: Without dead ends: 854 [2021-11-07 01:01:14,120 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:01:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-11-07 01:01:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 803. [2021-11-07 01:01:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 794 states have (on average 1.942065491183879) internal successors, (1542), 802 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1542 transitions. [2021-11-07 01:01:14,129 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1542 transitions. Word has length 24 [2021-11-07 01:01:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:14,129 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1542 transitions. [2021-11-07 01:01:14,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1542 transitions. [2021-11-07 01:01:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:14,131 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:14,131 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:14,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-07 01:01:14,131 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash -614636568, now seen corresponding path program 20 times [2021-11-07 01:01:14,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:14,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907044468] [2021-11-07 01:01:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:14,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:15,186 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:15,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907044468] [2021-11-07 01:01:15,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907044468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:15,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:15,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:15,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87890639] [2021-11-07 01:01:15,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:15,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:15,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:15,188 INFO L87 Difference]: Start difference. First operand 803 states and 1542 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:16,925 INFO L93 Difference]: Finished difference Result 856 states and 1648 transitions. [2021-11-07 01:01:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:01:16,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:16,926 INFO L225 Difference]: With dead ends: 856 [2021-11-07 01:01:16,926 INFO L226 Difference]: Without dead ends: 856 [2021-11-07 01:01:16,926 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:01:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-11-07 01:01:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 801. [2021-11-07 01:01:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 792 states have (on average 1.9419191919191918) internal successors, (1538), 800 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1538 transitions. [2021-11-07 01:01:16,936 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1538 transitions. Word has length 24 [2021-11-07 01:01:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:16,936 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1538 transitions. [2021-11-07 01:01:16,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1538 transitions. [2021-11-07 01:01:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:16,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:16,937 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:16,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-07 01:01:16,937 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:16,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2077844008, now seen corresponding path program 21 times [2021-11-07 01:01:16,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:16,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159723346] [2021-11-07 01:01:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:16,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:17,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:17,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159723346] [2021-11-07 01:01:17,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159723346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:17,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:17,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:17,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150521423] [2021-11-07 01:01:17,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:17,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:17,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:17,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:17,872 INFO L87 Difference]: Start difference. First operand 801 states and 1538 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:19,466 INFO L93 Difference]: Finished difference Result 852 states and 1640 transitions. [2021-11-07 01:01:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:01:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:19,467 INFO L225 Difference]: With dead ends: 852 [2021-11-07 01:01:19,467 INFO L226 Difference]: Without dead ends: 852 [2021-11-07 01:01:19,468 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:01:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-11-07 01:01:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 803. [2021-11-07 01:01:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 794 states have (on average 1.942065491183879) internal successors, (1542), 802 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1542 transitions. [2021-11-07 01:01:19,476 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1542 transitions. Word has length 24 [2021-11-07 01:01:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:19,476 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1542 transitions. [2021-11-07 01:01:19,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1542 transitions. [2021-11-07 01:01:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:19,477 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:19,477 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:19,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-07 01:01:19,477 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:19,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2123424238, now seen corresponding path program 22 times [2021-11-07 01:01:19,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:19,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155544339] [2021-11-07 01:01:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:19,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:20,349 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:20,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155544339] [2021-11-07 01:01:20,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155544339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:20,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:20,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:20,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974386353] [2021-11-07 01:01:20,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:20,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:20,351 INFO L87 Difference]: Start difference. First operand 803 states and 1542 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:22,012 INFO L93 Difference]: Finished difference Result 866 states and 1668 transitions. [2021-11-07 01:01:22,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:01:22,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:22,013 INFO L225 Difference]: With dead ends: 866 [2021-11-07 01:01:22,013 INFO L226 Difference]: Without dead ends: 866 [2021-11-07 01:01:22,013 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:01:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-11-07 01:01:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 808. [2021-11-07 01:01:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 799 states have (on average 1.9424280350438048) internal successors, (1552), 807 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1552 transitions. [2021-11-07 01:01:22,023 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1552 transitions. Word has length 24 [2021-11-07 01:01:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:22,023 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1552 transitions. [2021-11-07 01:01:22,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1552 transitions. [2021-11-07 01:01:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:22,024 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:22,024 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:22,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-07 01:01:22,025 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:22,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 510273286, now seen corresponding path program 23 times [2021-11-07 01:01:22,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:22,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745262526] [2021-11-07 01:01:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:22,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:22,895 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:22,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745262526] [2021-11-07 01:01:22,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745262526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:22,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:22,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:22,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706213174] [2021-11-07 01:01:22,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:22,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:22,897 INFO L87 Difference]: Start difference. First operand 808 states and 1552 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:24,244 INFO L93 Difference]: Finished difference Result 859 states and 1654 transitions. [2021-11-07 01:01:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:01:24,244 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:24,245 INFO L225 Difference]: With dead ends: 859 [2021-11-07 01:01:24,245 INFO L226 Difference]: Without dead ends: 859 [2021-11-07 01:01:24,245 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:01:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-11-07 01:01:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 804. [2021-11-07 01:01:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 795 states have (on average 1.9421383647798742) internal successors, (1544), 803 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1544 transitions. [2021-11-07 01:01:24,254 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1544 transitions. Word has length 24 [2021-11-07 01:01:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:24,254 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1544 transitions. [2021-11-07 01:01:24,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1544 transitions. [2021-11-07 01:01:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:24,255 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:24,255 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:24,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-11-07 01:01:24,255 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash -926869966, now seen corresponding path program 24 times [2021-11-07 01:01:24,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:24,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697936811] [2021-11-07 01:01:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:24,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:24,932 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:24,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697936811] [2021-11-07 01:01:24,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697936811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:24,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:24,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:24,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636089660] [2021-11-07 01:01:24,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:24,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:24,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:24,933 INFO L87 Difference]: Start difference. First operand 804 states and 1544 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:27,483 INFO L93 Difference]: Finished difference Result 872 states and 1661 transitions. [2021-11-07 01:01:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 01:01:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:27,484 INFO L225 Difference]: With dead ends: 872 [2021-11-07 01:01:27,484 INFO L226 Difference]: Without dead ends: 872 [2021-11-07 01:01:27,485 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 01:01:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-11-07 01:01:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 811. [2021-11-07 01:01:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 802 states have (on average 1.942643391521197) internal successors, (1558), 810 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1558 transitions. [2021-11-07 01:01:27,497 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1558 transitions. Word has length 24 [2021-11-07 01:01:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:27,497 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1558 transitions. [2021-11-07 01:01:27,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1558 transitions. [2021-11-07 01:01:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:27,498 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:27,498 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:27,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-11-07 01:01:27,498 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash -925381036, now seen corresponding path program 25 times [2021-11-07 01:01:27,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:27,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049857300] [2021-11-07 01:01:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:27,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:28,151 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:28,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049857300] [2021-11-07 01:01:28,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049857300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:28,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:28,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:28,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474421464] [2021-11-07 01:01:28,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:28,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:28,152 INFO L87 Difference]: Start difference. First operand 811 states and 1558 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:29,941 INFO L93 Difference]: Finished difference Result 878 states and 1673 transitions. [2021-11-07 01:01:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:01:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:29,942 INFO L225 Difference]: With dead ends: 878 [2021-11-07 01:01:29,942 INFO L226 Difference]: Without dead ends: 878 [2021-11-07 01:01:29,943 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:01:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2021-11-07 01:01:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 807. [2021-11-07 01:01:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 798 states have (on average 1.9423558897243107) internal successors, (1550), 806 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1550 transitions. [2021-11-07 01:01:29,951 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1550 transitions. Word has length 24 [2021-11-07 01:01:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:29,952 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 1550 transitions. [2021-11-07 01:01:29,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1550 transitions. [2021-11-07 01:01:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:29,953 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:29,953 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:29,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-11-07 01:01:29,953 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1746273452, now seen corresponding path program 26 times [2021-11-07 01:01:29,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:29,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670741339] [2021-11-07 01:01:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:29,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:30,965 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:30,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670741339] [2021-11-07 01:01:30,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670741339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:30,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:30,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:30,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845275805] [2021-11-07 01:01:30,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:30,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:30,966 INFO L87 Difference]: Start difference. First operand 807 states and 1550 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:32,437 INFO L93 Difference]: Finished difference Result 859 states and 1654 transitions. [2021-11-07 01:01:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:01:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:32,439 INFO L225 Difference]: With dead ends: 859 [2021-11-07 01:01:32,439 INFO L226 Difference]: Without dead ends: 859 [2021-11-07 01:01:32,439 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:01:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-11-07 01:01:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 810. [2021-11-07 01:01:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 801 states have (on average 1.9425717852684146) internal successors, (1556), 809 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1556 transitions. [2021-11-07 01:01:32,464 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1556 transitions. Word has length 24 [2021-11-07 01:01:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:32,465 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1556 transitions. [2021-11-07 01:01:32,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1556 transitions. [2021-11-07 01:01:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:32,466 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:32,466 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:32,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-11-07 01:01:32,467 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1587599790, now seen corresponding path program 27 times [2021-11-07 01:01:32,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:32,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182046820] [2021-11-07 01:01:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:32,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:33,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:33,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182046820] [2021-11-07 01:01:33,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182046820] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:33,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:33,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:33,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173456888] [2021-11-07 01:01:33,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:33,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:33,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:33,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:33,400 INFO L87 Difference]: Start difference. First operand 810 states and 1556 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:35,391 INFO L93 Difference]: Finished difference Result 864 states and 1664 transitions. [2021-11-07 01:01:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:01:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:35,392 INFO L225 Difference]: With dead ends: 864 [2021-11-07 01:01:35,392 INFO L226 Difference]: Without dead ends: 864 [2021-11-07 01:01:35,393 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:01:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-11-07 01:01:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 805. [2021-11-07 01:01:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 796 states have (on average 1.9422110552763818) internal successors, (1546), 804 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1546 transitions. [2021-11-07 01:01:35,402 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1546 transitions. Word has length 24 [2021-11-07 01:01:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:35,402 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1546 transitions. [2021-11-07 01:01:35,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1546 transitions. [2021-11-07 01:01:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:35,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:35,403 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:35,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-11-07 01:01:35,403 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -30052882, now seen corresponding path program 28 times [2021-11-07 01:01:35,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:35,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557906527] [2021-11-07 01:01:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:35,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:36,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:36,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557906527] [2021-11-07 01:01:36,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557906527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:36,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:36,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:36,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092814870] [2021-11-07 01:01:36,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:36,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:36,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:36,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:36,149 INFO L87 Difference]: Start difference. First operand 805 states and 1546 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:37,579 INFO L93 Difference]: Finished difference Result 896 states and 1709 transitions. [2021-11-07 01:01:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:01:37,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:37,581 INFO L225 Difference]: With dead ends: 896 [2021-11-07 01:01:37,581 INFO L226 Difference]: Without dead ends: 896 [2021-11-07 01:01:37,581 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:01:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2021-11-07 01:01:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 803. [2021-11-07 01:01:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 794 states have (on average 1.942065491183879) internal successors, (1542), 802 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1542 transitions. [2021-11-07 01:01:37,593 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1542 transitions. Word has length 24 [2021-11-07 01:01:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:37,594 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1542 transitions. [2021-11-07 01:01:37,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1542 transitions. [2021-11-07 01:01:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:37,595 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:37,595 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:37,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-11-07 01:01:37,595 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1197914770, now seen corresponding path program 29 times [2021-11-07 01:01:37,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:37,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173136054] [2021-11-07 01:01:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:37,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:38,378 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:38,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173136054] [2021-11-07 01:01:38,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173136054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:38,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:38,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:38,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482280128] [2021-11-07 01:01:38,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:38,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:38,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:38,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:38,383 INFO L87 Difference]: Start difference. First operand 803 states and 1542 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:39,714 INFO L93 Difference]: Finished difference Result 874 states and 1665 transitions. [2021-11-07 01:01:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:01:39,715 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:39,716 INFO L225 Difference]: With dead ends: 874 [2021-11-07 01:01:39,716 INFO L226 Difference]: Without dead ends: 874 [2021-11-07 01:01:39,716 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:01:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-07 01:01:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 808. [2021-11-07 01:01:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 799 states have (on average 1.9424280350438048) internal successors, (1552), 807 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1552 transitions. [2021-11-07 01:01:39,724 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1552 transitions. Word has length 24 [2021-11-07 01:01:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:39,724 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1552 transitions. [2021-11-07 01:01:39,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1552 transitions. [2021-11-07 01:01:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:39,725 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:39,726 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:39,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-11-07 01:01:39,726 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2135958472, now seen corresponding path program 30 times [2021-11-07 01:01:39,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:39,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439704889] [2021-11-07 01:01:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:39,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:40,480 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:40,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439704889] [2021-11-07 01:01:40,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439704889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:40,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:40,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:40,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534744809] [2021-11-07 01:01:40,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:40,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:40,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:40,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:40,481 INFO L87 Difference]: Start difference. First operand 808 states and 1552 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:42,337 INFO L93 Difference]: Finished difference Result 874 states and 1665 transitions. [2021-11-07 01:01:42,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:01:42,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:42,338 INFO L225 Difference]: With dead ends: 874 [2021-11-07 01:01:42,338 INFO L226 Difference]: Without dead ends: 874 [2021-11-07 01:01:42,338 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:01:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-07 01:01:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 798. [2021-11-07 01:01:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 789 states have (on average 1.9416983523447402) internal successors, (1532), 797 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1532 transitions. [2021-11-07 01:01:42,347 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1532 transitions. Word has length 24 [2021-11-07 01:01:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:42,348 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1532 transitions. [2021-11-07 01:01:42,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1532 transitions. [2021-11-07 01:01:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:42,348 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:42,348 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:42,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-11-07 01:01:42,349 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1348808102, now seen corresponding path program 31 times [2021-11-07 01:01:42,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:42,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966563246] [2021-11-07 01:01:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:42,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:42,949 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:42,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966563246] [2021-11-07 01:01:42,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966563246] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:42,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:42,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:42,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375371019] [2021-11-07 01:01:42,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:42,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:42,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:42,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:42,951 INFO L87 Difference]: Start difference. First operand 798 states and 1532 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:44,291 INFO L93 Difference]: Finished difference Result 847 states and 1611 transitions. [2021-11-07 01:01:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:01:44,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:44,292 INFO L225 Difference]: With dead ends: 847 [2021-11-07 01:01:44,292 INFO L226 Difference]: Without dead ends: 847 [2021-11-07 01:01:44,292 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:01:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-11-07 01:01:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 796. [2021-11-07 01:01:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 787 states have (on average 1.9415501905972046) internal successors, (1528), 795 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1528 transitions. [2021-11-07 01:01:44,300 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1528 transitions. Word has length 24 [2021-11-07 01:01:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:44,300 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 1528 transitions. [2021-11-07 01:01:44,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1528 transitions. [2021-11-07 01:01:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:44,301 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:44,301 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:44,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-11-07 01:01:44,301 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:44,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -253678618, now seen corresponding path program 32 times [2021-11-07 01:01:44,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:44,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22402547] [2021-11-07 01:01:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:44,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:45,078 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:45,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22402547] [2021-11-07 01:01:45,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22402547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:45,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:45,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:45,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143394319] [2021-11-07 01:01:45,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:45,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:45,079 INFO L87 Difference]: Start difference. First operand 796 states and 1528 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:46,628 INFO L93 Difference]: Finished difference Result 832 states and 1600 transitions. [2021-11-07 01:01:46,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:01:46,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:46,629 INFO L225 Difference]: With dead ends: 832 [2021-11-07 01:01:46,629 INFO L226 Difference]: Without dead ends: 832 [2021-11-07 01:01:46,629 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:01:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-11-07 01:01:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 801. [2021-11-07 01:01:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 792 states have (on average 1.9419191919191918) internal successors, (1538), 800 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1538 transitions. [2021-11-07 01:01:46,638 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1538 transitions. Word has length 24 [2021-11-07 01:01:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:46,638 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1538 transitions. [2021-11-07 01:01:46,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1538 transitions. [2021-11-07 01:01:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:46,639 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:46,639 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:46,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-11-07 01:01:46,639 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:46,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:46,640 INFO L85 PathProgramCache]: Analyzing trace with hash -208098388, now seen corresponding path program 33 times [2021-11-07 01:01:46,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:46,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240317391] [2021-11-07 01:01:46,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:46,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:47,602 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:47,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240317391] [2021-11-07 01:01:47,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240317391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:47,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:47,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:47,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803354045] [2021-11-07 01:01:47,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:47,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:47,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:47,604 INFO L87 Difference]: Start difference. First operand 801 states and 1538 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:49,173 INFO L93 Difference]: Finished difference Result 843 states and 1622 transitions. [2021-11-07 01:01:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:01:49,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:49,174 INFO L225 Difference]: With dead ends: 843 [2021-11-07 01:01:49,174 INFO L226 Difference]: Without dead ends: 843 [2021-11-07 01:01:49,175 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:01:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-11-07 01:01:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 801. [2021-11-07 01:01:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 792 states have (on average 1.9419191919191918) internal successors, (1538), 800 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1538 transitions. [2021-11-07 01:01:49,183 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1538 transitions. Word has length 24 [2021-11-07 01:01:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:49,184 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1538 transitions. [2021-11-07 01:01:49,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1538 transitions. [2021-11-07 01:01:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:49,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:49,184 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:49,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-11-07 01:01:49,185 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1821249340, now seen corresponding path program 34 times [2021-11-07 01:01:49,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:49,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303434074] [2021-11-07 01:01:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:49,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:50,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:50,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303434074] [2021-11-07 01:01:50,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303434074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:50,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:50,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:01:50,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782173039] [2021-11-07 01:01:50,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:01:50,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:01:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:01:50,339 INFO L87 Difference]: Start difference. First operand 801 states and 1538 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:52,203 INFO L93 Difference]: Finished difference Result 836 states and 1608 transitions. [2021-11-07 01:01:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:01:52,203 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:01:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:52,204 INFO L225 Difference]: With dead ends: 836 [2021-11-07 01:01:52,204 INFO L226 Difference]: Without dead ends: 836 [2021-11-07 01:01:52,204 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:01:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-11-07 01:01:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 799. [2021-11-07 01:01:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 790 states have (on average 1.941772151898734) internal successors, (1534), 798 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1534 transitions. [2021-11-07 01:01:52,213 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1534 transitions. Word has length 24 [2021-11-07 01:01:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:52,213 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1534 transitions. [2021-11-07 01:01:52,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:01:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1534 transitions. [2021-11-07 01:01:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:52,214 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:52,214 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:52,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-11-07 01:01:52,214 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:52,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:52,215 INFO L85 PathProgramCache]: Analyzing trace with hash 180946214, now seen corresponding path program 35 times [2021-11-07 01:01:52,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:52,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503144541] [2021-11-07 01:01:52,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:52,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:53,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:53,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503144541] [2021-11-07 01:01:53,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503144541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:53,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:53,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:53,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453148305] [2021-11-07 01:01:53,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:53,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:53,105 INFO L87 Difference]: Start difference. First operand 799 states and 1534 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:54,758 INFO L93 Difference]: Finished difference Result 858 states and 1633 transitions. [2021-11-07 01:01:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:01:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:54,760 INFO L225 Difference]: With dead ends: 858 [2021-11-07 01:01:54,760 INFO L226 Difference]: Without dead ends: 858 [2021-11-07 01:01:54,760 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:01:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2021-11-07 01:01:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 799. [2021-11-07 01:01:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 790 states have (on average 1.941772151898734) internal successors, (1534), 798 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1534 transitions. [2021-11-07 01:01:54,769 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1534 transitions. Word has length 24 [2021-11-07 01:01:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:54,769 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1534 transitions. [2021-11-07 01:01:54,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1534 transitions. [2021-11-07 01:01:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:54,770 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:54,770 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:54,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-11-07 01:01:54,770 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -780147840, now seen corresponding path program 36 times [2021-11-07 01:01:54,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:54,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513356453] [2021-11-07 01:01:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:54,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:55,548 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:55,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513356453] [2021-11-07 01:01:55,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513356453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:55,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:55,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:55,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785769459] [2021-11-07 01:01:55,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:55,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:55,549 INFO L87 Difference]: Start difference. First operand 799 states and 1534 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:57,247 INFO L93 Difference]: Finished difference Result 859 states and 1635 transitions. [2021-11-07 01:01:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:01:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:57,249 INFO L225 Difference]: With dead ends: 859 [2021-11-07 01:01:57,249 INFO L226 Difference]: Without dead ends: 859 [2021-11-07 01:01:57,249 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:01:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-11-07 01:01:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 791. [2021-11-07 01:01:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 782 states have (on average 1.9411764705882353) internal successors, (1518), 790 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1518 transitions. [2021-11-07 01:01:57,274 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1518 transitions. Word has length 24 [2021-11-07 01:01:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:57,274 INFO L470 AbstractCegarLoop]: Abstraction has 791 states and 1518 transitions. [2021-11-07 01:01:57,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1518 transitions. [2021-11-07 01:01:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:57,274 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:57,275 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:57,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-11-07 01:01:57,275 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1107149060, now seen corresponding path program 37 times [2021-11-07 01:01:57,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:57,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132466047] [2021-11-07 01:01:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:57,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:58,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:58,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132466047] [2021-11-07 01:01:58,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132466047] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:01:58,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:01:58,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:01:58,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222817305] [2021-11-07 01:01:58,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:01:58,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:58,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:01:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:01:58,192 INFO L87 Difference]: Start difference. First operand 791 states and 1518 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:59,761 INFO L93 Difference]: Finished difference Result 822 states and 1561 transitions. [2021-11-07 01:01:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:01:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:01:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:59,763 INFO L225 Difference]: With dead ends: 822 [2021-11-07 01:01:59,763 INFO L226 Difference]: Without dead ends: 822 [2021-11-07 01:01:59,763 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:01:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-11-07 01:01:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 791. [2021-11-07 01:01:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 782 states have (on average 1.9411764705882353) internal successors, (1518), 790 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:01:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1518 transitions. [2021-11-07 01:01:59,775 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1518 transitions. Word has length 24 [2021-11-07 01:01:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:59,775 INFO L470 AbstractCegarLoop]: Abstraction has 791 states and 1518 transitions. [2021-11-07 01:01:59,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:01:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1518 transitions. [2021-11-07 01:01:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:01:59,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:59,776 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:59,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-11-07 01:01:59,777 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:01:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1558496846, now seen corresponding path program 38 times [2021-11-07 01:01:59,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:59,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467085846] [2021-11-07 01:01:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:59,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:00,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:00,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467085846] [2021-11-07 01:02:00,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467085846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:00,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:00,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:00,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788536446] [2021-11-07 01:02:00,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:00,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:00,762 INFO L87 Difference]: Start difference. First operand 791 states and 1518 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:02,538 INFO L93 Difference]: Finished difference Result 837 states and 1591 transitions. [2021-11-07 01:02:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:02:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:02,539 INFO L225 Difference]: With dead ends: 837 [2021-11-07 01:02:02,539 INFO L226 Difference]: Without dead ends: 837 [2021-11-07 01:02:02,540 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:02:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2021-11-07 01:02:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 796. [2021-11-07 01:02:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 787 states have (on average 1.9415501905972046) internal successors, (1528), 795 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1528 transitions. [2021-11-07 01:02:02,549 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1528 transitions. Word has length 24 [2021-11-07 01:02:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:02,550 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 1528 transitions. [2021-11-07 01:02:02,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1528 transitions. [2021-11-07 01:02:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:02,550 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:02,551 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:02,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-11-07 01:02:02,551 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1838341456, now seen corresponding path program 39 times [2021-11-07 01:02:02,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:02,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474827989] [2021-11-07 01:02:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:02,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:03,188 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:03,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474827989] [2021-11-07 01:02:03,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474827989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:03,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:03,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:03,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023338733] [2021-11-07 01:02:03,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:03,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:03,190 INFO L87 Difference]: Start difference. First operand 796 states and 1528 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:04,993 INFO L93 Difference]: Finished difference Result 833 states and 1583 transitions. [2021-11-07 01:02:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:02:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:04,994 INFO L225 Difference]: With dead ends: 833 [2021-11-07 01:02:04,995 INFO L226 Difference]: Without dead ends: 833 [2021-11-07 01:02:04,995 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:02:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-11-07 01:02:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 791. [2021-11-07 01:02:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 782 states have (on average 1.9411764705882353) internal successors, (1518), 790 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1518 transitions. [2021-11-07 01:02:05,005 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1518 transitions. Word has length 24 [2021-11-07 01:02:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:05,006 INFO L470 AbstractCegarLoop]: Abstraction has 791 states and 1518 transitions. [2021-11-07 01:02:05,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1518 transitions. [2021-11-07 01:02:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:05,006 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:05,006 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:05,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-11-07 01:02:05,007 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash 806100746, now seen corresponding path program 40 times [2021-11-07 01:02:05,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:05,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267864117] [2021-11-07 01:02:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:05,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:05,593 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:05,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267864117] [2021-11-07 01:02:05,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267864117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:05,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:05,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:05,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268657833] [2021-11-07 01:02:05,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:05,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:05,594 INFO L87 Difference]: Start difference. First operand 791 states and 1518 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:06,802 INFO L93 Difference]: Finished difference Result 1289 states and 2500 transitions. [2021-11-07 01:02:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:02:06,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:06,804 INFO L225 Difference]: With dead ends: 1289 [2021-11-07 01:02:06,804 INFO L226 Difference]: Without dead ends: 1289 [2021-11-07 01:02:06,804 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:02:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2021-11-07 01:02:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 841. [2021-11-07 01:02:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 832 states have (on average 1.9447115384615385) internal successors, (1618), 840 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1618 transitions. [2021-11-07 01:02:06,817 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1618 transitions. Word has length 24 [2021-11-07 01:02:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:06,818 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1618 transitions. [2021-11-07 01:02:06,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1618 transitions. [2021-11-07 01:02:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:06,818 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:06,818 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:06,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-11-07 01:02:06,819 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash 807589676, now seen corresponding path program 41 times [2021-11-07 01:02:06,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:06,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269495846] [2021-11-07 01:02:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:06,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:07,671 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:07,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269495846] [2021-11-07 01:02:07,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269495846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:07,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:07,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:07,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680315825] [2021-11-07 01:02:07,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:07,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:07,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:07,673 INFO L87 Difference]: Start difference. First operand 841 states and 1618 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:09,067 INFO L93 Difference]: Finished difference Result 1321 states and 2564 transitions. [2021-11-07 01:02:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:02:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:09,069 INFO L225 Difference]: With dead ends: 1321 [2021-11-07 01:02:09,069 INFO L226 Difference]: Without dead ends: 1321 [2021-11-07 01:02:09,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:02:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-11-07 01:02:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 839. [2021-11-07 01:02:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 830 states have (on average 1.9445783132530121) internal successors, (1614), 838 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1614 transitions. [2021-11-07 01:02:09,082 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1614 transitions. Word has length 24 [2021-11-07 01:02:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:09,082 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1614 transitions. [2021-11-07 01:02:09,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1614 transitions. [2021-11-07 01:02:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:09,083 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:09,083 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:09,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-11-07 01:02:09,083 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -794897044, now seen corresponding path program 42 times [2021-11-07 01:02:09,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:09,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939294883] [2021-11-07 01:02:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:09,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:09,855 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:09,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939294883] [2021-11-07 01:02:09,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939294883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:09,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:09,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:09,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421473470] [2021-11-07 01:02:09,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:09,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:09,856 INFO L87 Difference]: Start difference. First operand 839 states and 1614 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:11,246 INFO L93 Difference]: Finished difference Result 1317 states and 2556 transitions. [2021-11-07 01:02:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:02:11,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:11,248 INFO L225 Difference]: With dead ends: 1317 [2021-11-07 01:02:11,248 INFO L226 Difference]: Without dead ends: 1317 [2021-11-07 01:02:11,248 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-11-07 01:02:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 841. [2021-11-07 01:02:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 832 states have (on average 1.9447115384615385) internal successors, (1618), 840 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1618 transitions. [2021-11-07 01:02:11,261 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1618 transitions. Word has length 24 [2021-11-07 01:02:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:11,261 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1618 transitions. [2021-11-07 01:02:11,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1618 transitions. [2021-11-07 01:02:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:11,262 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:11,262 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:11,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-11-07 01:02:11,262 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash -749316814, now seen corresponding path program 43 times [2021-11-07 01:02:11,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:11,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506872429] [2021-11-07 01:02:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:11,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:12,225 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:12,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506872429] [2021-11-07 01:02:12,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506872429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:12,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:12,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:12,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631622685] [2021-11-07 01:02:12,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:12,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:12,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:12,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:12,226 INFO L87 Difference]: Start difference. First operand 841 states and 1618 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:13,650 INFO L93 Difference]: Finished difference Result 1326 states and 2574 transitions. [2021-11-07 01:02:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:02:13,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:13,652 INFO L225 Difference]: With dead ends: 1326 [2021-11-07 01:02:13,652 INFO L226 Difference]: Without dead ends: 1326 [2021-11-07 01:02:13,652 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-11-07 01:02:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 839. [2021-11-07 01:02:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 830 states have (on average 1.9445783132530121) internal successors, (1614), 838 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1614 transitions. [2021-11-07 01:02:13,665 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1614 transitions. Word has length 24 [2021-11-07 01:02:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:13,665 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1614 transitions. [2021-11-07 01:02:13,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1614 transitions. [2021-11-07 01:02:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:13,666 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:13,666 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:13,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-11-07 01:02:13,666 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:13,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1932499530, now seen corresponding path program 44 times [2021-11-07 01:02:13,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:13,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208005901] [2021-11-07 01:02:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:13,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:14,792 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:14,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208005901] [2021-11-07 01:02:14,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208005901] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:14,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:14,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:14,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379605114] [2021-11-07 01:02:14,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:14,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:14,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:14,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:14,793 INFO L87 Difference]: Start difference. First operand 839 states and 1614 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:16,113 INFO L93 Difference]: Finished difference Result 1319 states and 2560 transitions. [2021-11-07 01:02:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:02:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:16,115 INFO L225 Difference]: With dead ends: 1319 [2021-11-07 01:02:16,115 INFO L226 Difference]: Without dead ends: 1319 [2021-11-07 01:02:16,115 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2021-11-07 01:02:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 837. [2021-11-07 01:02:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 828 states have (on average 1.9444444444444444) internal successors, (1610), 836 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1610 transitions. [2021-11-07 01:02:16,127 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1610 transitions. Word has length 24 [2021-11-07 01:02:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:16,128 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1610 transitions. [2021-11-07 01:02:16,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1610 transitions. [2021-11-07 01:02:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:16,128 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:16,128 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:16,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-11-07 01:02:16,129 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash 451563508, now seen corresponding path program 45 times [2021-11-07 01:02:16,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:16,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371449831] [2021-11-07 01:02:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:16,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:16,437 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:16,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371449831] [2021-11-07 01:02:16,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371449831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:16,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:16,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:16,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022855154] [2021-11-07 01:02:16,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:16,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:16,439 INFO L87 Difference]: Start difference. First operand 837 states and 1610 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:18,567 INFO L93 Difference]: Finished difference Result 1533 states and 2964 transitions. [2021-11-07 01:02:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-07 01:02:18,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:18,569 INFO L225 Difference]: With dead ends: 1533 [2021-11-07 01:02:18,569 INFO L226 Difference]: Without dead ends: 1533 [2021-11-07 01:02:18,569 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 01:02:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2021-11-07 01:02:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 839. [2021-11-07 01:02:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 830 states have (on average 1.9445783132530121) internal successors, (1614), 838 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1614 transitions. [2021-11-07 01:02:18,583 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1614 transitions. Word has length 24 [2021-11-07 01:02:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:18,583 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1614 transitions. [2021-11-07 01:02:18,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1614 transitions. [2021-11-07 01:02:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:18,584 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:18,584 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:18,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-11-07 01:02:18,584 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 495356278, now seen corresponding path program 46 times [2021-11-07 01:02:18,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:18,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068745924] [2021-11-07 01:02:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:18,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:19,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:19,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068745924] [2021-11-07 01:02:19,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068745924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:19,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:19,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:02:19,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181578861] [2021-11-07 01:02:19,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:02:19,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:19,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:02:19,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:02:19,004 INFO L87 Difference]: Start difference. First operand 839 states and 1614 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:02:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:20,750 INFO L93 Difference]: Finished difference Result 1465 states and 2828 transitions. [2021-11-07 01:02:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 01:02:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:02:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:20,751 INFO L225 Difference]: With dead ends: 1465 [2021-11-07 01:02:20,752 INFO L226 Difference]: Without dead ends: 1465 [2021-11-07 01:02:20,752 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2021-11-07 01:02:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2021-11-07 01:02:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 846. [2021-11-07 01:02:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 837 states have (on average 1.945041816009558) internal successors, (1628), 845 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1628 transitions. [2021-11-07 01:02:20,763 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1628 transitions. Word has length 24 [2021-11-07 01:02:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:20,763 INFO L470 AbstractCegarLoop]: Abstraction has 846 states and 1628 transitions. [2021-11-07 01:02:20,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:02:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1628 transitions. [2021-11-07 01:02:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:20,764 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:20,764 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:20,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-11-07 01:02:20,764 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 496845208, now seen corresponding path program 47 times [2021-11-07 01:02:20,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:20,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838432252] [2021-11-07 01:02:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:20,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:21,365 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:21,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838432252] [2021-11-07 01:02:21,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838432252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:21,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:21,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:02:21,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258045451] [2021-11-07 01:02:21,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:02:21,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:02:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:02:21,366 INFO L87 Difference]: Start difference. First operand 846 states and 1628 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:02:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:23,136 INFO L93 Difference]: Finished difference Result 1319 states and 2541 transitions. [2021-11-07 01:02:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:02:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:02:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:23,138 INFO L225 Difference]: With dead ends: 1319 [2021-11-07 01:02:23,138 INFO L226 Difference]: Without dead ends: 1319 [2021-11-07 01:02:23,139 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:02:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2021-11-07 01:02:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 842. [2021-11-07 01:02:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 833 states have (on average 1.9447779111644659) internal successors, (1620), 841 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1620 transitions. [2021-11-07 01:02:23,150 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1620 transitions. Word has length 24 [2021-11-07 01:02:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:23,150 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1620 transitions. [2021-11-07 01:02:23,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:02:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1620 transitions. [2021-11-07 01:02:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:23,151 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:23,151 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:23,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-11-07 01:02:23,151 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash -324047208, now seen corresponding path program 48 times [2021-11-07 01:02:23,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:23,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158649183] [2021-11-07 01:02:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:23,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:24,047 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:24,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158649183] [2021-11-07 01:02:24,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158649183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:24,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:24,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:24,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824344191] [2021-11-07 01:02:24,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:24,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:24,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:24,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:24,049 INFO L87 Difference]: Start difference. First operand 842 states and 1620 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:25,238 INFO L93 Difference]: Finished difference Result 1318 states and 2558 transitions. [2021-11-07 01:02:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:02:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:25,240 INFO L225 Difference]: With dead ends: 1318 [2021-11-07 01:02:25,240 INFO L226 Difference]: Without dead ends: 1318 [2021-11-07 01:02:25,241 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2021-11-07 01:02:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 845. [2021-11-07 01:02:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 836 states have (on average 1.944976076555024) internal successors, (1626), 844 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1626 transitions. [2021-11-07 01:02:25,273 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1626 transitions. Word has length 24 [2021-11-07 01:02:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:25,273 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1626 transitions. [2021-11-07 01:02:25,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1626 transitions. [2021-11-07 01:02:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:25,274 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:25,274 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:25,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-11-07 01:02:25,274 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1285141262, now seen corresponding path program 49 times [2021-11-07 01:02:25,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:25,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279472652] [2021-11-07 01:02:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:25,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:26,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:26,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279472652] [2021-11-07 01:02:26,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279472652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:26,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:26,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:26,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332292098] [2021-11-07 01:02:26,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:26,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:26,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:26,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:26,316 INFO L87 Difference]: Start difference. First operand 845 states and 1626 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:27,736 INFO L93 Difference]: Finished difference Result 1325 states and 2572 transitions. [2021-11-07 01:02:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:02:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:27,738 INFO L225 Difference]: With dead ends: 1325 [2021-11-07 01:02:27,738 INFO L226 Difference]: Without dead ends: 1325 [2021-11-07 01:02:27,739 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:02:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2021-11-07 01:02:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 840. [2021-11-07 01:02:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 831 states have (on average 1.9446450060168472) internal successors, (1616), 839 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1616 transitions. [2021-11-07 01:02:27,750 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1616 transitions. Word has length 24 [2021-11-07 01:02:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:27,751 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1616 transitions. [2021-11-07 01:02:27,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1616 transitions. [2021-11-07 01:02:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:27,751 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:27,751 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:27,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-11-07 01:02:27,752 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1392173362, now seen corresponding path program 50 times [2021-11-07 01:02:27,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:27,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818316825] [2021-11-07 01:02:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:27,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:28,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:28,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818316825] [2021-11-07 01:02:28,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818316825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:28,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:28,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:28,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406405442] [2021-11-07 01:02:28,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:28,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:28,252 INFO L87 Difference]: Start difference. First operand 840 states and 1616 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:29,706 INFO L93 Difference]: Finished difference Result 1476 states and 2850 transitions. [2021-11-07 01:02:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:02:29,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:29,709 INFO L225 Difference]: With dead ends: 1476 [2021-11-07 01:02:29,709 INFO L226 Difference]: Without dead ends: 1476 [2021-11-07 01:02:29,709 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:02:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-11-07 01:02:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 838. [2021-11-07 01:02:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 829 states have (on average 1.9445114595898674) internal successors, (1612), 837 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1612 transitions. [2021-11-07 01:02:29,744 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1612 transitions. Word has length 24 [2021-11-07 01:02:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:29,744 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1612 transitions. [2021-11-07 01:02:29,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1612 transitions. [2021-11-07 01:02:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:29,745 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:29,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:29,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-11-07 01:02:29,745 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:29,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -210313358, now seen corresponding path program 51 times [2021-11-07 01:02:29,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:29,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222941666] [2021-11-07 01:02:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:29,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:30,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:30,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222941666] [2021-11-07 01:02:30,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222941666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:30,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:30,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:02:30,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015866621] [2021-11-07 01:02:30,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:02:30,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:02:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:02:30,799 INFO L87 Difference]: Start difference. First operand 838 states and 1612 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:02:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:32,354 INFO L93 Difference]: Finished difference Result 1326 states and 2574 transitions. [2021-11-07 01:02:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:02:32,355 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:02:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:32,357 INFO L225 Difference]: With dead ends: 1326 [2021-11-07 01:02:32,358 INFO L226 Difference]: Without dead ends: 1326 [2021-11-07 01:02:32,358 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:02:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-11-07 01:02:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 839. [2021-11-07 01:02:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 830 states have (on average 1.9445783132530121) internal successors, (1614), 838 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1614 transitions. [2021-11-07 01:02:32,376 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1614 transitions. Word has length 24 [2021-11-07 01:02:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:32,376 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1614 transitions. [2021-11-07 01:02:32,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:02:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1614 transitions. [2021-11-07 01:02:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:32,377 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:32,379 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:32,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-11-07 01:02:32,379 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -164733128, now seen corresponding path program 52 times [2021-11-07 01:02:32,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:32,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823126604] [2021-11-07 01:02:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:32,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:33,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:33,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823126604] [2021-11-07 01:02:33,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823126604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:33,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:33,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:33,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244046594] [2021-11-07 01:02:33,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:33,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:33,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:33,336 INFO L87 Difference]: Start difference. First operand 839 states and 1614 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:35,070 INFO L93 Difference]: Finished difference Result 1336 states and 2594 transitions. [2021-11-07 01:02:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:02:35,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:35,073 INFO L225 Difference]: With dead ends: 1336 [2021-11-07 01:02:35,073 INFO L226 Difference]: Without dead ends: 1336 [2021-11-07 01:02:35,073 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2021-11-07 01:02:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 839. [2021-11-07 01:02:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 830 states have (on average 1.9445783132530121) internal successors, (1614), 838 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1614 transitions. [2021-11-07 01:02:35,094 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1614 transitions. Word has length 24 [2021-11-07 01:02:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:35,094 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1614 transitions. [2021-11-07 01:02:35,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1614 transitions. [2021-11-07 01:02:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:35,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:35,096 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:35,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-11-07 01:02:35,096 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1777884080, now seen corresponding path program 53 times [2021-11-07 01:02:35,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:35,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275713794] [2021-11-07 01:02:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:35,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:36,039 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:36,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275713794] [2021-11-07 01:02:36,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275713794] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:36,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:36,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:36,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316471660] [2021-11-07 01:02:36,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:36,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:36,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:36,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:36,041 INFO L87 Difference]: Start difference. First operand 839 states and 1614 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:37,146 INFO L93 Difference]: Finished difference Result 1321 states and 2564 transitions. [2021-11-07 01:02:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:02:37,147 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:37,148 INFO L225 Difference]: With dead ends: 1321 [2021-11-07 01:02:37,148 INFO L226 Difference]: Without dead ends: 1321 [2021-11-07 01:02:37,148 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:02:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-11-07 01:02:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 836. [2021-11-07 01:02:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 827 states have (on average 1.9443772672309552) internal successors, (1608), 835 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1608 transitions. [2021-11-07 01:02:37,159 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1608 transitions. Word has length 24 [2021-11-07 01:02:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:37,160 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1608 transitions. [2021-11-07 01:02:37,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1608 transitions. [2021-11-07 01:02:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:37,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:37,160 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:37,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-11-07 01:02:37,161 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:37,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash 224311474, now seen corresponding path program 54 times [2021-11-07 01:02:37,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:37,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434582124] [2021-11-07 01:02:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:37,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:37,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:37,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434582124] [2021-11-07 01:02:37,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434582124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:37,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:37,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:37,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225596876] [2021-11-07 01:02:37,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:37,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:37,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:37,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:37,816 INFO L87 Difference]: Start difference. First operand 836 states and 1608 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:38,902 INFO L93 Difference]: Finished difference Result 1299 states and 2501 transitions. [2021-11-07 01:02:38,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:02:38,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:38,904 INFO L225 Difference]: With dead ends: 1299 [2021-11-07 01:02:38,904 INFO L226 Difference]: Without dead ends: 1299 [2021-11-07 01:02:38,904 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:02:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2021-11-07 01:02:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 841. [2021-11-07 01:02:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 832 states have (on average 1.9447115384615385) internal successors, (1618), 840 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1618 transitions. [2021-11-07 01:02:38,916 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1618 transitions. Word has length 24 [2021-11-07 01:02:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:38,917 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1618 transitions. [2021-11-07 01:02:38,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1618 transitions. [2021-11-07 01:02:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:38,917 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:38,917 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:38,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-11-07 01:02:38,918 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash -736782580, now seen corresponding path program 55 times [2021-11-07 01:02:38,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:38,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099004066] [2021-11-07 01:02:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:38,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:39,381 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:39,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099004066] [2021-11-07 01:02:39,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099004066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:39,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:39,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:39,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562806599] [2021-11-07 01:02:39,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:39,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:39,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:39,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:39,382 INFO L87 Difference]: Start difference. First operand 841 states and 1618 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:40,632 INFO L93 Difference]: Finished difference Result 1455 states and 2808 transitions. [2021-11-07 01:02:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:02:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:40,634 INFO L225 Difference]: With dead ends: 1455 [2021-11-07 01:02:40,634 INFO L226 Difference]: Without dead ends: 1455 [2021-11-07 01:02:40,635 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:02:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-11-07 01:02:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 831. [2021-11-07 01:02:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 822 states have (on average 1.9440389294403893) internal successors, (1598), 830 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1598 transitions. [2021-11-07 01:02:40,647 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1598 transitions. Word has length 24 [2021-11-07 01:02:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:40,647 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1598 transitions. [2021-11-07 01:02:40,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1598 transitions. [2021-11-07 01:02:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:40,648 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:40,648 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:40,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-11-07 01:02:40,648 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1228063168, now seen corresponding path program 56 times [2021-11-07 01:02:40,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:40,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328587968] [2021-11-07 01:02:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:40,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:40,852 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:40,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328587968] [2021-11-07 01:02:40,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328587968] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:40,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:40,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:40,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436446146] [2021-11-07 01:02:40,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:40,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:40,854 INFO L87 Difference]: Start difference. First operand 831 states and 1598 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:42,148 INFO L93 Difference]: Finished difference Result 1492 states and 2861 transitions. [2021-11-07 01:02:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 01:02:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:42,151 INFO L225 Difference]: With dead ends: 1492 [2021-11-07 01:02:42,151 INFO L226 Difference]: Without dead ends: 1492 [2021-11-07 01:02:42,151 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:02:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2021-11-07 01:02:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 847. [2021-11-07 01:02:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 838 states have (on average 1.9451073985680192) internal successors, (1630), 846 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1630 transitions. [2021-11-07 01:02:42,165 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1630 transitions. Word has length 24 [2021-11-07 01:02:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:42,165 INFO L470 AbstractCegarLoop]: Abstraction has 847 states and 1630 transitions. [2021-11-07 01:02:42,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1630 transitions. [2021-11-07 01:02:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:42,166 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:42,166 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:42,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-11-07 01:02:42,167 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:42,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1271855938, now seen corresponding path program 57 times [2021-11-07 01:02:42,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:42,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553278954] [2021-11-07 01:02:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:42,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:42,504 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:42,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553278954] [2021-11-07 01:02:42,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553278954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:42,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:42,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:42,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502069818] [2021-11-07 01:02:42,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:42,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:42,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:42,506 INFO L87 Difference]: Start difference. First operand 847 states and 1630 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:43,819 INFO L93 Difference]: Finished difference Result 1459 states and 2795 transitions. [2021-11-07 01:02:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:02:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:43,821 INFO L225 Difference]: With dead ends: 1459 [2021-11-07 01:02:43,821 INFO L226 Difference]: Without dead ends: 1459 [2021-11-07 01:02:43,823 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2021-11-07 01:02:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 849. [2021-11-07 01:02:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 840 states have (on average 1.9452380952380952) internal successors, (1634), 848 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1634 transitions. [2021-11-07 01:02:43,841 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1634 transitions. Word has length 24 [2021-11-07 01:02:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:43,841 INFO L470 AbstractCegarLoop]: Abstraction has 849 states and 1634 transitions. [2021-11-07 01:02:43,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1634 transitions. [2021-11-07 01:02:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:43,842 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:43,842 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:43,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-11-07 01:02:43,842 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1273344868, now seen corresponding path program 58 times [2021-11-07 01:02:43,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:43,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653044583] [2021-11-07 01:02:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:43,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:44,275 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:44,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653044583] [2021-11-07 01:02:44,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653044583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:44,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:44,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:44,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741610793] [2021-11-07 01:02:44,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:44,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:44,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:44,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:44,276 INFO L87 Difference]: Start difference. First operand 849 states and 1634 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:45,124 INFO L93 Difference]: Finished difference Result 1455 states and 2787 transitions. [2021-11-07 01:02:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:02:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:45,126 INFO L225 Difference]: With dead ends: 1455 [2021-11-07 01:02:45,126 INFO L226 Difference]: Without dead ends: 1455 [2021-11-07 01:02:45,126 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-11-07 01:02:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-11-07 01:02:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 796. [2021-11-07 01:02:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 787 states have (on average 1.9415501905972046) internal successors, (1528), 795 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1528 transitions. [2021-11-07 01:02:45,141 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1528 transitions. Word has length 24 [2021-11-07 01:02:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:45,141 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 1528 transitions. [2021-11-07 01:02:45,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1528 transitions. [2021-11-07 01:02:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:45,142 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:45,142 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:45,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-11-07 01:02:45,143 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1518482128, now seen corresponding path program 59 times [2021-11-07 01:02:45,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:45,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491496509] [2021-11-07 01:02:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:45,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:45,355 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:45,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491496509] [2021-11-07 01:02:45,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491496509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:45,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:45,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:45,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122207245] [2021-11-07 01:02:45,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:45,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:45,356 INFO L87 Difference]: Start difference. First operand 796 states and 1528 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:47,220 INFO L93 Difference]: Finished difference Result 1885 states and 3595 transitions. [2021-11-07 01:02:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-07 01:02:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:47,223 INFO L225 Difference]: With dead ends: 1885 [2021-11-07 01:02:47,223 INFO L226 Difference]: Without dead ends: 1885 [2021-11-07 01:02:47,223 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 01:02:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2021-11-07 01:02:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 814. [2021-11-07 01:02:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 805 states have (on average 1.9428571428571428) internal successors, (1564), 813 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1564 transitions. [2021-11-07 01:02:47,239 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1564 transitions. Word has length 24 [2021-11-07 01:02:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:47,239 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1564 transitions. [2021-11-07 01:02:47,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1564 transitions. [2021-11-07 01:02:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:47,240 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:47,240 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:47,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-11-07 01:02:47,240 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1474689358, now seen corresponding path program 60 times [2021-11-07 01:02:47,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:47,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017266805] [2021-11-07 01:02:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:47,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:47,571 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:47,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017266805] [2021-11-07 01:02:47,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017266805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:47,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:47,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:47,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853645521] [2021-11-07 01:02:47,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:47,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:47,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:47,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:47,573 INFO L87 Difference]: Start difference. First operand 814 states and 1564 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:48,749 INFO L93 Difference]: Finished difference Result 1803 states and 3431 transitions. [2021-11-07 01:02:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:02:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:48,752 INFO L225 Difference]: With dead ends: 1803 [2021-11-07 01:02:48,752 INFO L226 Difference]: Without dead ends: 1803 [2021-11-07 01:02:48,752 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:02:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2021-11-07 01:02:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 816. [2021-11-07 01:02:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 807 states have (on average 1.942998760842627) internal successors, (1568), 815 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1568 transitions. [2021-11-07 01:02:48,767 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1568 transitions. Word has length 24 [2021-11-07 01:02:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:48,767 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1568 transitions. [2021-11-07 01:02:48,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1568 transitions. [2021-11-07 01:02:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:48,768 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:48,768 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:48,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-11-07 01:02:48,768 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:48,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1473200428, now seen corresponding path program 61 times [2021-11-07 01:02:48,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:48,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121375688] [2021-11-07 01:02:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:48,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:49,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:49,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121375688] [2021-11-07 01:02:49,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121375688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:49,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:49,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:49,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037804547] [2021-11-07 01:02:49,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:49,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:49,264 INFO L87 Difference]: Start difference. First operand 816 states and 1568 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:50,468 INFO L93 Difference]: Finished difference Result 1793 states and 3412 transitions. [2021-11-07 01:02:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:02:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:50,470 INFO L225 Difference]: With dead ends: 1793 [2021-11-07 01:02:50,470 INFO L226 Difference]: Without dead ends: 1793 [2021-11-07 01:02:50,471 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:02:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2021-11-07 01:02:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 856. [2021-11-07 01:02:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 847 states have (on average 1.9456906729634003) internal successors, (1648), 855 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1648 transitions. [2021-11-07 01:02:50,483 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1648 transitions. Word has length 24 [2021-11-07 01:02:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:50,483 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1648 transitions. [2021-11-07 01:02:50,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1648 transitions. [2021-11-07 01:02:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:50,484 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:50,484 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:50,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-11-07 01:02:50,484 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1128129580, now seen corresponding path program 62 times [2021-11-07 01:02:50,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:50,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345197360] [2021-11-07 01:02:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:50,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:51,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:51,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345197360] [2021-11-07 01:02:51,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345197360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:51,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:51,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:51,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63598329] [2021-11-07 01:02:51,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:51,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:51,058 INFO L87 Difference]: Start difference. First operand 856 states and 1648 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:52,531 INFO L93 Difference]: Finished difference Result 1527 states and 2953 transitions. [2021-11-07 01:02:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:02:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:52,533 INFO L225 Difference]: With dead ends: 1527 [2021-11-07 01:02:52,533 INFO L226 Difference]: Without dead ends: 1527 [2021-11-07 01:02:52,534 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:02:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2021-11-07 01:02:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 861. [2021-11-07 01:02:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 852 states have (on average 1.9460093896713615) internal successors, (1658), 860 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1658 transitions. [2021-11-07 01:02:52,547 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1658 transitions. Word has length 24 [2021-11-07 01:02:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:52,547 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1658 transitions. [2021-11-07 01:02:52,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1658 transitions. [2021-11-07 01:02:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:52,548 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:52,548 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:52,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-11-07 01:02:52,548 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1126640650, now seen corresponding path program 63 times [2021-11-07 01:02:52,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:52,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693962984] [2021-11-07 01:02:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:52,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:53,291 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:53,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693962984] [2021-11-07 01:02:53,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693962984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:53,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:53,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:53,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073652050] [2021-11-07 01:02:53,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:53,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:53,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:53,293 INFO L87 Difference]: Start difference. First operand 861 states and 1658 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:54,391 INFO L93 Difference]: Finished difference Result 1398 states and 2712 transitions. [2021-11-07 01:02:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:02:54,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:54,393 INFO L225 Difference]: With dead ends: 1398 [2021-11-07 01:02:54,393 INFO L226 Difference]: Without dead ends: 1398 [2021-11-07 01:02:54,393 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2021-11-07 01:02:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 859. [2021-11-07 01:02:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 850 states have (on average 1.9458823529411764) internal successors, (1654), 858 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1654 transitions. [2021-11-07 01:02:54,405 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1654 transitions. Word has length 24 [2021-11-07 01:02:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:54,405 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1654 transitions. [2021-11-07 01:02:54,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1654 transitions. [2021-11-07 01:02:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:54,406 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:54,406 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:54,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-11-07 01:02:54,406 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:54,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1565839926, now seen corresponding path program 64 times [2021-11-07 01:02:54,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:54,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160172521] [2021-11-07 01:02:54,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:54,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:55,162 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:55,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160172521] [2021-11-07 01:02:55,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160172521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:55,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:55,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:55,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714610167] [2021-11-07 01:02:55,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:55,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:55,163 INFO L87 Difference]: Start difference. First operand 859 states and 1654 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:56,362 INFO L93 Difference]: Finished difference Result 1394 states and 2704 transitions. [2021-11-07 01:02:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:02:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:56,364 INFO L225 Difference]: With dead ends: 1394 [2021-11-07 01:02:56,364 INFO L226 Difference]: Without dead ends: 1394 [2021-11-07 01:02:56,364 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:02:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-11-07 01:02:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 861. [2021-11-07 01:02:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 852 states have (on average 1.9460093896713615) internal successors, (1658), 860 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1658 transitions. [2021-11-07 01:02:56,378 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1658 transitions. Word has length 24 [2021-11-07 01:02:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:56,378 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1658 transitions. [2021-11-07 01:02:56,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1658 transitions. [2021-11-07 01:02:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:56,379 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:56,379 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:56,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-11-07 01:02:56,379 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1611420156, now seen corresponding path program 65 times [2021-11-07 01:02:56,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:56,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904475919] [2021-11-07 01:02:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:56,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:57,333 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:02:57,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904475919] [2021-11-07 01:02:57,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904475919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:57,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:57,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:02:57,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981314607] [2021-11-07 01:02:57,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:02:57,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:02:57,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:02:57,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:02:57,336 INFO L87 Difference]: Start difference. First operand 861 states and 1658 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:58,659 INFO L93 Difference]: Finished difference Result 1403 states and 2722 transitions. [2021-11-07 01:02:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:02:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:02:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:58,661 INFO L225 Difference]: With dead ends: 1403 [2021-11-07 01:02:58,661 INFO L226 Difference]: Without dead ends: 1403 [2021-11-07 01:02:58,662 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:02:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2021-11-07 01:02:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 859. [2021-11-07 01:02:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 850 states have (on average 1.9458823529411764) internal successors, (1654), 858 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1654 transitions. [2021-11-07 01:02:58,677 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1654 transitions. Word has length 24 [2021-11-07 01:02:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:58,677 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1654 transitions. [2021-11-07 01:02:58,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:02:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1654 transitions. [2021-11-07 01:02:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:02:58,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:58,679 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:58,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-11-07 01:02:58,679 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:02:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1730796, now seen corresponding path program 66 times [2021-11-07 01:02:58,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:02:58,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133952147] [2021-11-07 01:02:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:58,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:02:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:00,022 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:00,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133952147] [2021-11-07 01:03:00,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133952147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:00,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:00,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:00,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30544921] [2021-11-07 01:03:00,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:00,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:00,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:00,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:00,024 INFO L87 Difference]: Start difference. First operand 859 states and 1654 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:01,399 INFO L93 Difference]: Finished difference Result 1396 states and 2708 transitions. [2021-11-07 01:03:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:03:01,399 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:01,401 INFO L225 Difference]: With dead ends: 1396 [2021-11-07 01:03:01,401 INFO L226 Difference]: Without dead ends: 1396 [2021-11-07 01:03:01,401 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:03:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2021-11-07 01:03:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 857. [2021-11-07 01:03:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 848 states have (on average 1.945754716981132) internal successors, (1650), 856 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1650 transitions. [2021-11-07 01:03:01,413 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1650 transitions. Word has length 24 [2021-11-07 01:03:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:01,413 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1650 transitions. [2021-11-07 01:03:01,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1650 transitions. [2021-11-07 01:03:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:01,414 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:01,414 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:01,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-11-07 01:03:01,414 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1482666818, now seen corresponding path program 67 times [2021-11-07 01:03:01,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:01,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599870510] [2021-11-07 01:03:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:01,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:01,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:01,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599870510] [2021-11-07 01:03:01,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599870510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:01,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:01,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:01,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019163920] [2021-11-07 01:03:01,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:01,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:01,709 INFO L87 Difference]: Start difference. First operand 857 states and 1650 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:04,219 INFO L93 Difference]: Finished difference Result 1584 states and 3086 transitions. [2021-11-07 01:03:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 01:03:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:04,221 INFO L225 Difference]: With dead ends: 1584 [2021-11-07 01:03:04,221 INFO L226 Difference]: Without dead ends: 1584 [2021-11-07 01:03:04,222 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=336, Invalid=924, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 01:03:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2021-11-07 01:03:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 859. [2021-11-07 01:03:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 850 states have (on average 1.9458823529411764) internal successors, (1654), 858 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1654 transitions. [2021-11-07 01:03:04,237 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1654 transitions. Word has length 24 [2021-11-07 01:03:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:04,237 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1654 transitions. [2021-11-07 01:03:04,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1654 transitions. [2021-11-07 01:03:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:04,239 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:04,239 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:04,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-11-07 01:03:04,239 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1438874048, now seen corresponding path program 68 times [2021-11-07 01:03:04,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:04,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632661570] [2021-11-07 01:03:04,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:04,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:04,739 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:04,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632661570] [2021-11-07 01:03:04,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632661570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:04,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:04,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:03:04,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182431668] [2021-11-07 01:03:04,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:03:04,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:04,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:03:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:03:04,743 INFO L87 Difference]: Start difference. First operand 859 states and 1654 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:03:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:06,368 INFO L93 Difference]: Finished difference Result 1512 states and 2946 transitions. [2021-11-07 01:03:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 01:03:06,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:03:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:06,370 INFO L225 Difference]: With dead ends: 1512 [2021-11-07 01:03:06,370 INFO L226 Difference]: Without dead ends: 1512 [2021-11-07 01:03:06,370 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2021-11-07 01:03:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2021-11-07 01:03:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 861. [2021-11-07 01:03:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 852 states have (on average 1.9460093896713615) internal successors, (1658), 860 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1658 transitions. [2021-11-07 01:03:06,386 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1658 transitions. Word has length 24 [2021-11-07 01:03:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:06,387 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1658 transitions. [2021-11-07 01:03:06,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:03:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1658 transitions. [2021-11-07 01:03:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:06,388 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:06,388 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:06,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-11-07 01:03:06,388 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1437385118, now seen corresponding path program 69 times [2021-11-07 01:03:06,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:06,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914662170] [2021-11-07 01:03:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:06,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:07,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:07,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914662170] [2021-11-07 01:03:07,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914662170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:07,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:07,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:03:07,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780823441] [2021-11-07 01:03:07,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:03:07,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:07,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:03:07,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:03:07,174 INFO L87 Difference]: Start difference. First operand 861 states and 1658 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:03:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:08,769 INFO L93 Difference]: Finished difference Result 1515 states and 2952 transitions. [2021-11-07 01:03:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:03:08,770 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:03:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:08,771 INFO L225 Difference]: With dead ends: 1515 [2021-11-07 01:03:08,771 INFO L226 Difference]: Without dead ends: 1515 [2021-11-07 01:03:08,771 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:03:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-11-07 01:03:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 857. [2021-11-07 01:03:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 848 states have (on average 1.945754716981132) internal successors, (1650), 856 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1650 transitions. [2021-11-07 01:03:08,784 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1650 transitions. Word has length 24 [2021-11-07 01:03:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:08,784 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1650 transitions. [2021-11-07 01:03:08,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:03:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1650 transitions. [2021-11-07 01:03:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:08,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:08,785 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:08,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-11-07 01:03:08,785 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:08,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2036689762, now seen corresponding path program 70 times [2021-11-07 01:03:08,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:08,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531461702] [2021-11-07 01:03:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:08,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:09,731 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:09,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531461702] [2021-11-07 01:03:09,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531461702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:09,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:09,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:09,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137723366] [2021-11-07 01:03:09,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:09,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:09,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:09,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:09,732 INFO L87 Difference]: Start difference. First operand 857 states and 1650 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:11,068 INFO L93 Difference]: Finished difference Result 1395 states and 2706 transitions. [2021-11-07 01:03:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:03:11,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:11,071 INFO L225 Difference]: With dead ends: 1395 [2021-11-07 01:03:11,071 INFO L226 Difference]: Without dead ends: 1395 [2021-11-07 01:03:11,071 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:03:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2021-11-07 01:03:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 860. [2021-11-07 01:03:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 851 states have (on average 1.945945945945946) internal successors, (1656), 859 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1656 transitions. [2021-11-07 01:03:11,083 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1656 transitions. Word has length 24 [2021-11-07 01:03:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:11,083 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1656 transitions. [2021-11-07 01:03:11,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1656 transitions. [2021-11-07 01:03:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:11,084 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:11,084 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:11,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-11-07 01:03:11,084 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1075595708, now seen corresponding path program 71 times [2021-11-07 01:03:11,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:11,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354918898] [2021-11-07 01:03:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:11,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:12,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:12,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354918898] [2021-11-07 01:03:12,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354918898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:12,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:12,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:12,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759911839] [2021-11-07 01:03:12,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:12,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:12,069 INFO L87 Difference]: Start difference. First operand 860 states and 1656 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:13,095 INFO L93 Difference]: Finished difference Result 1402 states and 2720 transitions. [2021-11-07 01:03:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:03:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:13,097 INFO L225 Difference]: With dead ends: 1402 [2021-11-07 01:03:13,097 INFO L226 Difference]: Without dead ends: 1402 [2021-11-07 01:03:13,098 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:03:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2021-11-07 01:03:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 855. [2021-11-07 01:03:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 846 states have (on average 1.9456264775413712) internal successors, (1646), 854 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1646 transitions. [2021-11-07 01:03:13,109 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1646 transitions. Word has length 24 [2021-11-07 01:03:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:13,109 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1646 transitions. [2021-11-07 01:03:13,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1646 transitions. [2021-11-07 01:03:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:13,110 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:13,110 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:13,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-11-07 01:03:13,110 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash -542056964, now seen corresponding path program 72 times [2021-11-07 01:03:13,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:13,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216647763] [2021-11-07 01:03:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:13,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:13,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:13,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216647763] [2021-11-07 01:03:13,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216647763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:13,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:13,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:13,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595283199] [2021-11-07 01:03:13,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:13,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:13,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:13,591 INFO L87 Difference]: Start difference. First operand 855 states and 1646 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:14,716 INFO L93 Difference]: Finished difference Result 1523 states and 2968 transitions. [2021-11-07 01:03:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:03:14,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:14,718 INFO L225 Difference]: With dead ends: 1523 [2021-11-07 01:03:14,718 INFO L226 Difference]: Without dead ends: 1523 [2021-11-07 01:03:14,718 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:03:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2021-11-07 01:03:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 853. [2021-11-07 01:03:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 844 states have (on average 1.9454976303317535) internal successors, (1642), 852 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1642 transitions. [2021-11-07 01:03:14,731 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1642 transitions. Word has length 24 [2021-11-07 01:03:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:14,731 INFO L470 AbstractCegarLoop]: Abstraction has 853 states and 1642 transitions. [2021-11-07 01:03:14,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1642 transitions. [2021-11-07 01:03:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:14,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:14,732 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:14,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-11-07 01:03:14,732 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2144543684, now seen corresponding path program 73 times [2021-11-07 01:03:14,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:14,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365798274] [2021-11-07 01:03:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:14,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:15,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:15,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365798274] [2021-11-07 01:03:15,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365798274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:15,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:15,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:03:15,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310271286] [2021-11-07 01:03:15,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:03:15,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:15,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:03:15,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:03:15,809 INFO L87 Difference]: Start difference. First operand 853 states and 1642 transitions. Second operand has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:03:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:17,327 INFO L93 Difference]: Finished difference Result 1403 states and 2722 transitions. [2021-11-07 01:03:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:03:17,327 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) 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 24 [2021-11-07 01:03:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:17,330 INFO L225 Difference]: With dead ends: 1403 [2021-11-07 01:03:17,330 INFO L226 Difference]: Without dead ends: 1403 [2021-11-07 01:03:17,330 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:03:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2021-11-07 01:03:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 854. [2021-11-07 01:03:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 845 states have (on average 1.9455621301775148) internal successors, (1644), 853 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1644 transitions. [2021-11-07 01:03:17,348 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1644 transitions. Word has length 24 [2021-11-07 01:03:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:17,349 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 1644 transitions. [2021-11-07 01:03:17,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) 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) [2021-11-07 01:03:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1644 transitions. [2021-11-07 01:03:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:17,350 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:17,350 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:17,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-11-07 01:03:17,351 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2098963454, now seen corresponding path program 74 times [2021-11-07 01:03:17,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:17,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897637225] [2021-11-07 01:03:17,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:17,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:18,298 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:18,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897637225] [2021-11-07 01:03:18,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897637225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:18,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:18,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:18,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341062165] [2021-11-07 01:03:18,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:18,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:18,302 INFO L87 Difference]: Start difference. First operand 854 states and 1644 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:19,737 INFO L93 Difference]: Finished difference Result 1413 states and 2742 transitions. [2021-11-07 01:03:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:03:19,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:19,740 INFO L225 Difference]: With dead ends: 1413 [2021-11-07 01:03:19,740 INFO L226 Difference]: Without dead ends: 1413 [2021-11-07 01:03:19,740 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:03:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2021-11-07 01:03:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 854. [2021-11-07 01:03:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 845 states have (on average 1.9455621301775148) internal successors, (1644), 853 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1644 transitions. [2021-11-07 01:03:19,751 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1644 transitions. Word has length 24 [2021-11-07 01:03:19,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:19,752 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 1644 transitions. [2021-11-07 01:03:19,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1644 transitions. [2021-11-07 01:03:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:19,752 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:19,752 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:19,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-11-07 01:03:19,753 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:19,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:19,753 INFO L85 PathProgramCache]: Analyzing trace with hash 582852890, now seen corresponding path program 75 times [2021-11-07 01:03:19,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:19,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120106084] [2021-11-07 01:03:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:19,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:20,672 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:20,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120106084] [2021-11-07 01:03:20,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120106084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:20,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:20,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:20,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328259218] [2021-11-07 01:03:20,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:20,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:20,673 INFO L87 Difference]: Start difference. First operand 854 states and 1644 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:21,877 INFO L93 Difference]: Finished difference Result 1398 states and 2712 transitions. [2021-11-07 01:03:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:03:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:21,879 INFO L225 Difference]: With dead ends: 1398 [2021-11-07 01:03:21,879 INFO L226 Difference]: Without dead ends: 1398 [2021-11-07 01:03:21,879 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:03:21,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2021-11-07 01:03:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 851. [2021-11-07 01:03:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 842 states have (on average 1.9453681710213777) internal successors, (1638), 850 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1638 transitions. [2021-11-07 01:03:21,890 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1638 transitions. Word has length 24 [2021-11-07 01:03:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:21,891 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1638 transitions. [2021-11-07 01:03:21,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1638 transitions. [2021-11-07 01:03:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:21,891 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:21,891 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:21,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-11-07 01:03:21,892 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1709918852, now seen corresponding path program 76 times [2021-11-07 01:03:21,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:21,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564110462] [2021-11-07 01:03:21,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:21,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:22,339 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:22,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564110462] [2021-11-07 01:03:22,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564110462] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:22,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:22,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:22,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772611013] [2021-11-07 01:03:22,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:22,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:22,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:22,340 INFO L87 Difference]: Start difference. First operand 851 states and 1638 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:23,497 INFO L93 Difference]: Finished difference Result 1499 states and 2920 transitions. [2021-11-07 01:03:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:03:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:23,499 INFO L225 Difference]: With dead ends: 1499 [2021-11-07 01:03:23,499 INFO L226 Difference]: Without dead ends: 1499 [2021-11-07 01:03:23,499 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:03:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2021-11-07 01:03:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 846. [2021-11-07 01:03:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 837 states have (on average 1.945041816009558) internal successors, (1628), 845 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1628 transitions. [2021-11-07 01:03:23,511 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1628 transitions. Word has length 24 [2021-11-07 01:03:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:23,511 INFO L470 AbstractCegarLoop]: Abstraction has 846 states and 1628 transitions. [2021-11-07 01:03:23,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1628 transitions. [2021-11-07 01:03:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:23,512 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:23,512 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:23,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-11-07 01:03:23,512 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1623954390, now seen corresponding path program 77 times [2021-11-07 01:03:23,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:23,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869691023] [2021-11-07 01:03:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:23,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:23,983 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:23,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869691023] [2021-11-07 01:03:23,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869691023] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:23,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:23,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:23,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858851178] [2021-11-07 01:03:23,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:23,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:23,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:23,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:23,985 INFO L87 Difference]: Start difference. First operand 846 states and 1628 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:25,518 INFO L93 Difference]: Finished difference Result 1502 states and 2926 transitions. [2021-11-07 01:03:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:03:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:25,520 INFO L225 Difference]: With dead ends: 1502 [2021-11-07 01:03:25,520 INFO L226 Difference]: Without dead ends: 1502 [2021-11-07 01:03:25,521 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:03:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2021-11-07 01:03:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 836. [2021-11-07 01:03:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 827 states have (on average 1.9443772672309552) internal successors, (1608), 835 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1608 transitions. [2021-11-07 01:03:25,537 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1608 transitions. Word has length 24 [2021-11-07 01:03:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:25,538 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1608 transitions. [2021-11-07 01:03:25,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1608 transitions. [2021-11-07 01:03:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:25,539 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:25,539 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:25,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-11-07 01:03:25,539 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -706167158, now seen corresponding path program 78 times [2021-11-07 01:03:25,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:25,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194831370] [2021-11-07 01:03:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:25,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:25,770 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:25,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194831370] [2021-11-07 01:03:25,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194831370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:25,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:25,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:25,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640951575] [2021-11-07 01:03:25,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:25,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:25,772 INFO L87 Difference]: Start difference. First operand 836 states and 1608 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:26,899 INFO L93 Difference]: Finished difference Result 1750 states and 3370 transitions. [2021-11-07 01:03:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-07 01:03:26,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:26,901 INFO L225 Difference]: With dead ends: 1750 [2021-11-07 01:03:26,901 INFO L226 Difference]: Without dead ends: 1750 [2021-11-07 01:03:26,902 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:03:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2021-11-07 01:03:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 852. [2021-11-07 01:03:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 843 states have (on average 1.9454329774614472) internal successors, (1640), 851 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1640 transitions. [2021-11-07 01:03:26,915 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1640 transitions. Word has length 24 [2021-11-07 01:03:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:26,915 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 1640 transitions. [2021-11-07 01:03:26,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1640 transitions. [2021-11-07 01:03:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:26,916 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:26,916 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:26,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-11-07 01:03:26,916 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -662374388, now seen corresponding path program 79 times [2021-11-07 01:03:26,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:26,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698905942] [2021-11-07 01:03:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:26,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:27,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:27,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698905942] [2021-11-07 01:03:27,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698905942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:27,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:27,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:27,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646727109] [2021-11-07 01:03:27,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:27,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:27,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:27,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:27,148 INFO L87 Difference]: Start difference. First operand 852 states and 1640 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:28,491 INFO L93 Difference]: Finished difference Result 1717 states and 3304 transitions. [2021-11-07 01:03:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:03:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:28,493 INFO L225 Difference]: With dead ends: 1717 [2021-11-07 01:03:28,493 INFO L226 Difference]: Without dead ends: 1717 [2021-11-07 01:03:28,493 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:03:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2021-11-07 01:03:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 854. [2021-11-07 01:03:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 845 states have (on average 1.9455621301775148) internal successors, (1644), 853 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1644 transitions. [2021-11-07 01:03:28,506 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1644 transitions. Word has length 24 [2021-11-07 01:03:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:28,507 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 1644 transitions. [2021-11-07 01:03:28,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1644 transitions. [2021-11-07 01:03:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:28,507 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:28,507 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:28,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-11-07 01:03:28,508 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:28,508 INFO L85 PathProgramCache]: Analyzing trace with hash -660885458, now seen corresponding path program 80 times [2021-11-07 01:03:28,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:28,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952991114] [2021-11-07 01:03:28,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:28,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:28,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:28,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952991114] [2021-11-07 01:03:28,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952991114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:28,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:28,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:28,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732699317] [2021-11-07 01:03:28,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:28,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:28,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:28,904 INFO L87 Difference]: Start difference. First operand 854 states and 1644 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:29,727 INFO L93 Difference]: Finished difference Result 1713 states and 3296 transitions. [2021-11-07 01:03:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:03:29,728 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:29,730 INFO L225 Difference]: With dead ends: 1713 [2021-11-07 01:03:29,730 INFO L226 Difference]: Without dead ends: 1713 [2021-11-07 01:03:29,730 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:03:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2021-11-07 01:03:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 801. [2021-11-07 01:03:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 792 states have (on average 1.9419191919191918) internal successors, (1538), 800 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1538 transitions. [2021-11-07 01:03:29,742 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1538 transitions. Word has length 24 [2021-11-07 01:03:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:29,742 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1538 transitions. [2021-11-07 01:03:29,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1538 transitions. [2021-11-07 01:03:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:29,743 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:29,743 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:29,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-11-07 01:03:29,743 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash 842254842, now seen corresponding path program 81 times [2021-11-07 01:03:29,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:29,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243013244] [2021-11-07 01:03:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:29,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:29,924 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:29,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243013244] [2021-11-07 01:03:29,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243013244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:29,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:29,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:29,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103099143] [2021-11-07 01:03:29,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:29,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:29,926 INFO L87 Difference]: Start difference. First operand 801 states and 1538 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:31,756 INFO L93 Difference]: Finished difference Result 2199 states and 4211 transitions. [2021-11-07 01:03:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-07 01:03:31,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:31,759 INFO L225 Difference]: With dead ends: 2199 [2021-11-07 01:03:31,759 INFO L226 Difference]: Without dead ends: 2199 [2021-11-07 01:03:31,759 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=1411, Unknown=0, NotChecked=0, Total=1806 [2021-11-07 01:03:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2021-11-07 01:03:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 819. [2021-11-07 01:03:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 810 states have (on average 1.94320987654321) internal successors, (1574), 818 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1574 transitions. [2021-11-07 01:03:31,774 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1574 transitions. Word has length 24 [2021-11-07 01:03:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:31,775 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1574 transitions. [2021-11-07 01:03:31,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1574 transitions. [2021-11-07 01:03:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:31,775 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:31,776 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:31,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-11-07 01:03:31,776 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash 886047612, now seen corresponding path program 82 times [2021-11-07 01:03:31,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:31,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102102927] [2021-11-07 01:03:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:31,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:32,024 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:32,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102102927] [2021-11-07 01:03:32,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102102927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:32,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:32,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:32,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609839985] [2021-11-07 01:03:32,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:32,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:32,026 INFO L87 Difference]: Start difference. First operand 819 states and 1574 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:33,528 INFO L93 Difference]: Finished difference Result 2093 states and 4003 transitions. [2021-11-07 01:03:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:03:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:33,531 INFO L225 Difference]: With dead ends: 2093 [2021-11-07 01:03:33,531 INFO L226 Difference]: Without dead ends: 2093 [2021-11-07 01:03:33,532 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:03:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2021-11-07 01:03:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 821. [2021-11-07 01:03:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 812 states have (on average 1.9433497536945812) internal successors, (1578), 820 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1578 transitions. [2021-11-07 01:03:33,548 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1578 transitions. Word has length 24 [2021-11-07 01:03:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:33,549 INFO L470 AbstractCegarLoop]: Abstraction has 821 states and 1578 transitions. [2021-11-07 01:03:33,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1578 transitions. [2021-11-07 01:03:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:33,550 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:33,550 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:33,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-11-07 01:03:33,550 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash 887536542, now seen corresponding path program 83 times [2021-11-07 01:03:33,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:33,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576016738] [2021-11-07 01:03:33,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:33,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:34,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:34,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576016738] [2021-11-07 01:03:34,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576016738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:34,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:34,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:34,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588991244] [2021-11-07 01:03:34,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:34,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:34,082 INFO L87 Difference]: Start difference. First operand 821 states and 1578 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:35,194 INFO L93 Difference]: Finished difference Result 2083 states and 3984 transitions. [2021-11-07 01:03:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:03:35,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:35,196 INFO L225 Difference]: With dead ends: 2083 [2021-11-07 01:03:35,197 INFO L226 Difference]: Without dead ends: 2083 [2021-11-07 01:03:35,197 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:03:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2021-11-07 01:03:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 796. [2021-11-07 01:03:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 787 states have (on average 1.9415501905972046) internal successors, (1528), 795 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1528 transitions. [2021-11-07 01:03:35,212 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1528 transitions. Word has length 24 [2021-11-07 01:03:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:35,212 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 1528 transitions. [2021-11-07 01:03:35,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1528 transitions. [2021-11-07 01:03:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:35,213 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:35,213 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:35,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-11-07 01:03:35,213 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash 271520868, now seen corresponding path program 84 times [2021-11-07 01:03:35,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:35,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965155097] [2021-11-07 01:03:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:35,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:35,377 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:35,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965155097] [2021-11-07 01:03:35,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965155097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:35,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:35,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:35,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029139224] [2021-11-07 01:03:35,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:35,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:35,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:35,378 INFO L87 Difference]: Start difference. First operand 796 states and 1528 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:36,431 INFO L93 Difference]: Finished difference Result 1498 states and 2870 transitions. [2021-11-07 01:03:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:03:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:36,433 INFO L225 Difference]: With dead ends: 1498 [2021-11-07 01:03:36,434 INFO L226 Difference]: Without dead ends: 1498 [2021-11-07 01:03:36,434 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:03:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2021-11-07 01:03:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 795. [2021-11-07 01:03:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 786 states have (on average 1.9414758269720103) internal successors, (1526), 794 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1526 transitions. [2021-11-07 01:03:36,447 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1526 transitions. Word has length 24 [2021-11-07 01:03:36,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:36,447 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1526 transitions. [2021-11-07 01:03:36,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1526 transitions. [2021-11-07 01:03:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:03:36,448 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:36,448 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:36,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-11-07 01:03:36,448 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 315313638, now seen corresponding path program 85 times [2021-11-07 01:03:36,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:36,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158305974] [2021-11-07 01:03:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:36,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:36,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:36,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158305974] [2021-11-07 01:03:36,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158305974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:36,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:36,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:36,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241220015] [2021-11-07 01:03:36,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:36,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:36,715 INFO L87 Difference]: Start difference. First operand 795 states and 1526 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:38,095 INFO L93 Difference]: Finished difference Result 1481 states and 2836 transitions. [2021-11-07 01:03:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:03:38,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2021-11-07 01:03:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:38,097 INFO L225 Difference]: With dead ends: 1481 [2021-11-07 01:03:38,097 INFO L226 Difference]: Without dead ends: 1481 [2021-11-07 01:03:38,098 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:03:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-11-07 01:03:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 803. [2021-11-07 01:03:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 794 states have (on average 1.942065491183879) internal successors, (1542), 802 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1542 transitions. [2021-11-07 01:03:38,112 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1542 transitions. Word has length 24 [2021-11-07 01:03:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:38,112 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1542 transitions. [2021-11-07 01:03:38,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) [2021-11-07 01:03:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1542 transitions. [2021-11-07 01:03:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:38,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:38,113 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:38,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-11-07 01:03:38,113 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -921229420, now seen corresponding path program 1 times [2021-11-07 01:03:38,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:38,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468417769] [2021-11-07 01:03:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:38,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:39,069 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:39,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468417769] [2021-11-07 01:03:39,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468417769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:39,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:39,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:39,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158469827] [2021-11-07 01:03:39,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:39,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:39,071 INFO L87 Difference]: Start difference. First operand 803 states and 1542 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:40,448 INFO L93 Difference]: Finished difference Result 1095 states and 2113 transitions. [2021-11-07 01:03:40,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:03:40,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:40,450 INFO L225 Difference]: With dead ends: 1095 [2021-11-07 01:03:40,450 INFO L226 Difference]: Without dead ends: 1095 [2021-11-07 01:03:40,450 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-11-07 01:03:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-11-07 01:03:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 816. [2021-11-07 01:03:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 807 states have (on average 1.942998760842627) internal successors, (1568), 815 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1568 transitions. [2021-11-07 01:03:40,460 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1568 transitions. Word has length 25 [2021-11-07 01:03:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:40,460 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1568 transitions. [2021-11-07 01:03:40,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1568 transitions. [2021-11-07 01:03:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:40,461 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:40,461 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:40,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-11-07 01:03:40,461 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash 992357972, now seen corresponding path program 2 times [2021-11-07 01:03:40,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:40,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571633140] [2021-11-07 01:03:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:40,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:41,684 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:41,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571633140] [2021-11-07 01:03:41,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571633140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:41,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:41,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 01:03:41,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350911113] [2021-11-07 01:03:41,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:03:41,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:03:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:03:41,685 INFO L87 Difference]: Start difference. First operand 816 states and 1568 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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) [2021-11-07 01:03:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:43,510 INFO L93 Difference]: Finished difference Result 1065 states and 2058 transitions. [2021-11-07 01:03:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:03:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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 25 [2021-11-07 01:03:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:43,511 INFO L225 Difference]: With dead ends: 1065 [2021-11-07 01:03:43,512 INFO L226 Difference]: Without dead ends: 1065 [2021-11-07 01:03:43,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-11-07 01:03:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-11-07 01:03:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 818. [2021-11-07 01:03:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 809 states have (on average 1.9431396786155748) internal successors, (1572), 817 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1572 transitions. [2021-11-07 01:03:43,522 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1572 transitions. Word has length 25 [2021-11-07 01:03:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:43,522 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 1572 transitions. [2021-11-07 01:03:43,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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) [2021-11-07 01:03:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1572 transitions. [2021-11-07 01:03:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:43,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:43,523 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:43,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-11-07 01:03:43,523 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1889622194, now seen corresponding path program 3 times [2021-11-07 01:03:43,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:43,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003733917] [2021-11-07 01:03:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:43,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:44,683 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:44,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003733917] [2021-11-07 01:03:44,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003733917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:44,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:44,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:44,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857825915] [2021-11-07 01:03:44,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:44,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:44,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:44,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:44,684 INFO L87 Difference]: Start difference. First operand 818 states and 1572 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:45,619 INFO L93 Difference]: Finished difference Result 1098 states and 2120 transitions. [2021-11-07 01:03:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:03:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:45,621 INFO L225 Difference]: With dead ends: 1098 [2021-11-07 01:03:45,621 INFO L226 Difference]: Without dead ends: 1098 [2021-11-07 01:03:45,621 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:03:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-11-07 01:03:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 818. [2021-11-07 01:03:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 809 states have (on average 1.9431396786155748) internal successors, (1572), 817 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1572 transitions. [2021-11-07 01:03:45,631 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1572 transitions. Word has length 25 [2021-11-07 01:03:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:45,631 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 1572 transitions. [2021-11-07 01:03:45,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1572 transitions. [2021-11-07 01:03:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:45,632 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:45,632 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:45,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-11-07 01:03:45,632 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -357694154, now seen corresponding path program 4 times [2021-11-07 01:03:45,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:45,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027614703] [2021-11-07 01:03:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:45,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:46,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:46,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027614703] [2021-11-07 01:03:46,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027614703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:46,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:46,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:46,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120826657] [2021-11-07 01:03:46,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:46,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:46,730 INFO L87 Difference]: Start difference. First operand 818 states and 1572 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:47,634 INFO L93 Difference]: Finished difference Result 1067 states and 2061 transitions. [2021-11-07 01:03:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:03:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:47,635 INFO L225 Difference]: With dead ends: 1067 [2021-11-07 01:03:47,635 INFO L226 Difference]: Without dead ends: 1067 [2021-11-07 01:03:47,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:03:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2021-11-07 01:03:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 824. [2021-11-07 01:03:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 815 states have (on average 1.943558282208589) internal successors, (1584), 823 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1584 transitions. [2021-11-07 01:03:47,646 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1584 transitions. Word has length 25 [2021-11-07 01:03:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:47,646 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 1584 transitions. [2021-11-07 01:03:47,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1584 transitions. [2021-11-07 01:03:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:47,647 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:47,647 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:47,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-11-07 01:03:47,647 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 826446370, now seen corresponding path program 5 times [2021-11-07 01:03:47,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:47,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164391206] [2021-11-07 01:03:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:47,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:48,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:48,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164391206] [2021-11-07 01:03:48,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164391206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:48,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:48,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:48,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784076818] [2021-11-07 01:03:48,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:48,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:48,237 INFO L87 Difference]: Start difference. First operand 824 states and 1584 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:50,327 INFO L93 Difference]: Finished difference Result 1164 states and 2227 transitions. [2021-11-07 01:03:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 01:03:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:50,328 INFO L225 Difference]: With dead ends: 1164 [2021-11-07 01:03:50,328 INFO L226 Difference]: Without dead ends: 1164 [2021-11-07 01:03:50,329 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=471, Invalid=1089, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 01:03:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2021-11-07 01:03:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 819. [2021-11-07 01:03:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 810 states have (on average 1.94320987654321) internal successors, (1574), 818 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1574 transitions. [2021-11-07 01:03:50,339 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1574 transitions. Word has length 25 [2021-11-07 01:03:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:50,339 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1574 transitions. [2021-11-07 01:03:50,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1574 transitions. [2021-11-07 01:03:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:50,340 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:50,340 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:50,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-11-07 01:03:50,340 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash -871867946, now seen corresponding path program 6 times [2021-11-07 01:03:50,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:50,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620150723] [2021-11-07 01:03:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:50,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:50,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:50,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620150723] [2021-11-07 01:03:50,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620150723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:50,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:50,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:50,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77679011] [2021-11-07 01:03:50,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:50,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:50,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:50,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:50,563 INFO L87 Difference]: Start difference. First operand 819 states and 1574 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:51,702 INFO L93 Difference]: Finished difference Result 1550 states and 2965 transitions. [2021-11-07 01:03:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 01:03:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:51,704 INFO L225 Difference]: With dead ends: 1550 [2021-11-07 01:03:51,704 INFO L226 Difference]: Without dead ends: 1550 [2021-11-07 01:03:51,705 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=322, Invalid=734, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 01:03:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2021-11-07 01:03:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 769. [2021-11-07 01:03:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 760 states have (on average 1.9394736842105262) internal successors, (1474), 768 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1474 transitions. [2021-11-07 01:03:51,716 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1474 transitions. Word has length 25 [2021-11-07 01:03:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:51,716 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1474 transitions. [2021-11-07 01:03:51,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1474 transitions. [2021-11-07 01:03:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:51,717 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:51,717 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:51,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-11-07 01:03:51,717 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -785596740, now seen corresponding path program 7 times [2021-11-07 01:03:51,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:51,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216798677] [2021-11-07 01:03:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:51,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:52,498 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:52,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216798677] [2021-11-07 01:03:52,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216798677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:52,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:52,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:52,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572454926] [2021-11-07 01:03:52,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:52,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:52,499 INFO L87 Difference]: Start difference. First operand 769 states and 1474 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:53,605 INFO L93 Difference]: Finished difference Result 1397 states and 2705 transitions. [2021-11-07 01:03:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:03:53,606 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:53,608 INFO L225 Difference]: With dead ends: 1397 [2021-11-07 01:03:53,608 INFO L226 Difference]: Without dead ends: 1397 [2021-11-07 01:03:53,608 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:03:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2021-11-07 01:03:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 809. [2021-11-07 01:03:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 800 states have (on average 1.9425) internal successors, (1554), 808 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1554 transitions. [2021-11-07 01:03:53,620 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1554 transitions. Word has length 25 [2021-11-07 01:03:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:53,620 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 1554 transitions. [2021-11-07 01:03:53,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1554 transitions. [2021-11-07 01:03:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:53,621 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:53,621 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:53,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-11-07 01:03:53,621 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1127990652, now seen corresponding path program 8 times [2021-11-07 01:03:53,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:53,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849149645] [2021-11-07 01:03:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:53,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:55,090 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:55,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849149645] [2021-11-07 01:03:55,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849149645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:55,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:55,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:55,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919872150] [2021-11-07 01:03:55,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:55,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:55,091 INFO L87 Difference]: Start difference. First operand 809 states and 1554 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:56,255 INFO L93 Difference]: Finished difference Result 1330 states and 2580 transitions. [2021-11-07 01:03:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:03:56,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:56,257 INFO L225 Difference]: With dead ends: 1330 [2021-11-07 01:03:56,257 INFO L226 Difference]: Without dead ends: 1330 [2021-11-07 01:03:56,258 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:03:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2021-11-07 01:03:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 811. [2021-11-07 01:03:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 802 states have (on average 1.942643391521197) internal successors, (1558), 810 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1558 transitions. [2021-11-07 01:03:56,269 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1558 transitions. Word has length 25 [2021-11-07 01:03:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:56,269 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1558 transitions. [2021-11-07 01:03:56,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1558 transitions. [2021-11-07 01:03:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:56,269 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:56,270 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:56,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-11-07 01:03:56,270 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1753989514, now seen corresponding path program 9 times [2021-11-07 01:03:56,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:56,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979798323] [2021-11-07 01:03:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:56,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:57,342 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:57,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979798323] [2021-11-07 01:03:57,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979798323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:57,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:57,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:03:57,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792075454] [2021-11-07 01:03:57,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:03:57,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:57,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:03:57,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:57,343 INFO L87 Difference]: Start difference. First operand 811 states and 1558 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:58,575 INFO L93 Difference]: Finished difference Result 1360 states and 2635 transitions. [2021-11-07 01:03:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:03:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:03:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:58,577 INFO L225 Difference]: With dead ends: 1360 [2021-11-07 01:03:58,577 INFO L226 Difference]: Without dead ends: 1360 [2021-11-07 01:03:58,577 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:03:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2021-11-07 01:03:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 816. [2021-11-07 01:03:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 807 states have (on average 1.942998760842627) internal successors, (1568), 815 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1568 transitions. [2021-11-07 01:03:58,589 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1568 transitions. Word has length 25 [2021-11-07 01:03:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:58,589 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1568 transitions. [2021-11-07 01:03:58,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:03:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1568 transitions. [2021-11-07 01:03:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:03:58,589 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:58,590 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:58,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-11-07 01:03:58,590 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:03:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash -222061474, now seen corresponding path program 10 times [2021-11-07 01:03:58,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:58,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019841389] [2021-11-07 01:03:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:58,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:59,577 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:59,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019841389] [2021-11-07 01:03:59,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019841389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:59,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:59,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:03:59,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433305322] [2021-11-07 01:03:59,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:03:59,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:59,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:03:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:03:59,578 INFO L87 Difference]: Start difference. First operand 816 states and 1568 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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) [2021-11-07 01:04:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:01,229 INFO L93 Difference]: Finished difference Result 1316 states and 2552 transitions. [2021-11-07 01:04:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:04:01,230 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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 25 [2021-11-07 01:04:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:01,231 INFO L225 Difference]: With dead ends: 1316 [2021-11-07 01:04:01,231 INFO L226 Difference]: Without dead ends: 1316 [2021-11-07 01:04:01,232 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:04:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2021-11-07 01:04:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 812. [2021-11-07 01:04:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 803 states have (on average 1.9427148194271482) internal successors, (1560), 811 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1560 transitions. [2021-11-07 01:04:01,243 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1560 transitions. Word has length 25 [2021-11-07 01:04:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:01,243 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1560 transitions. [2021-11-07 01:04:01,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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) [2021-11-07 01:04:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1560 transitions. [2021-11-07 01:04:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:01,244 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:01,244 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:01,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-11-07 01:04:01,244 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:01,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash 962079050, now seen corresponding path program 11 times [2021-11-07 01:04:01,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:01,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931280159] [2021-11-07 01:04:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:01,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:01,608 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:01,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931280159] [2021-11-07 01:04:01,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931280159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:01,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:01,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:04:01,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015487842] [2021-11-07 01:04:01,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:04:01,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:01,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:04:01,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:04:01,610 INFO L87 Difference]: Start difference. First operand 812 states and 1560 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:03,678 INFO L93 Difference]: Finished difference Result 1424 states and 2739 transitions. [2021-11-07 01:04:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-07 01:04:03,678 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:04:03,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:03,680 INFO L225 Difference]: With dead ends: 1424 [2021-11-07 01:04:03,680 INFO L226 Difference]: Without dead ends: 1424 [2021-11-07 01:04:03,680 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=517, Invalid=1375, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 01:04:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-11-07 01:04:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 773. [2021-11-07 01:04:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 764 states have (on average 1.9397905759162304) internal successors, (1482), 772 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1482 transitions. [2021-11-07 01:04:03,691 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1482 transitions. Word has length 25 [2021-11-07 01:04:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:03,691 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1482 transitions. [2021-11-07 01:04:03,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1482 transitions. [2021-11-07 01:04:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:03,692 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:03,692 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:03,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-11-07 01:04:03,692 INFO L402 AbstractCegarLoop]: === Iteration 160 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -617194702, now seen corresponding path program 12 times [2021-11-07 01:04:03,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:03,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374365049] [2021-11-07 01:04:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:03,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:04,462 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:04,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374365049] [2021-11-07 01:04:04,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374365049] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:04,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:04,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:04:04,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600840985] [2021-11-07 01:04:04,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:04:04,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:04:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:04:04,463 INFO L87 Difference]: Start difference. First operand 773 states and 1482 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:05,711 INFO L93 Difference]: Finished difference Result 1417 states and 2739 transitions. [2021-11-07 01:04:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:04:05,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:04:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:05,713 INFO L225 Difference]: With dead ends: 1417 [2021-11-07 01:04:05,713 INFO L226 Difference]: Without dead ends: 1417 [2021-11-07 01:04:05,714 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:04:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2021-11-07 01:04:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 776. [2021-11-07 01:04:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.940026075619296) internal successors, (1488), 775 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1488 transitions. [2021-11-07 01:04:05,726 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1488 transitions. Word has length 25 [2021-11-07 01:04:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:05,726 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 1488 transitions. [2021-11-07 01:04:05,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1488 transitions. [2021-11-07 01:04:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:05,727 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:05,727 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:05,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-11-07 01:04:05,727 INFO L402 AbstractCegarLoop]: === Iteration 161 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:05,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1296392690, now seen corresponding path program 13 times [2021-11-07 01:04:05,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:05,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588263085] [2021-11-07 01:04:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:05,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:06,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:06,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588263085] [2021-11-07 01:04:06,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588263085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:06,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:06,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:04:06,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778743665] [2021-11-07 01:04:06,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:04:06,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:04:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:04:06,927 INFO L87 Difference]: Start difference. First operand 776 states and 1488 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:08,108 INFO L93 Difference]: Finished difference Result 1350 states and 2614 transitions. [2021-11-07 01:04:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:04:08,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:04:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:08,110 INFO L225 Difference]: With dead ends: 1350 [2021-11-07 01:04:08,110 INFO L226 Difference]: Without dead ends: 1350 [2021-11-07 01:04:08,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:04:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-11-07 01:04:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 778. [2021-11-07 01:04:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 769 states have (on average 1.9401820546163848) internal successors, (1492), 777 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1492 transitions. [2021-11-07 01:04:08,121 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1492 transitions. Word has length 25 [2021-11-07 01:04:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:08,121 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1492 transitions. [2021-11-07 01:04:08,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1492 transitions. [2021-11-07 01:04:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:08,122 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:08,122 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:08,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-11-07 01:04:08,122 INFO L402 AbstractCegarLoop]: === Iteration 162 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1585587476, now seen corresponding path program 14 times [2021-11-07 01:04:08,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:08,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585481057] [2021-11-07 01:04:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:08,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:09,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:09,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585481057] [2021-11-07 01:04:09,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585481057] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:09,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:09,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:04:09,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721550000] [2021-11-07 01:04:09,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:04:09,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:04:09,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:04:09,049 INFO L87 Difference]: Start difference. First operand 778 states and 1492 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:10,138 INFO L93 Difference]: Finished difference Result 1380 states and 2669 transitions. [2021-11-07 01:04:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:04:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:04:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:10,140 INFO L225 Difference]: With dead ends: 1380 [2021-11-07 01:04:10,140 INFO L226 Difference]: Without dead ends: 1380 [2021-11-07 01:04:10,140 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:04:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2021-11-07 01:04:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 778. [2021-11-07 01:04:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 769 states have (on average 1.9401820546163848) internal successors, (1492), 777 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1492 transitions. [2021-11-07 01:04:10,151 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1492 transitions. Word has length 25 [2021-11-07 01:04:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:10,151 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1492 transitions. [2021-11-07 01:04:10,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1492 transitions. [2021-11-07 01:04:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:10,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:10,152 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:10,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-11-07 01:04:10,152 INFO L402 AbstractCegarLoop]: === Iteration 163 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash -53659436, now seen corresponding path program 15 times [2021-11-07 01:04:10,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:10,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092003810] [2021-11-07 01:04:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:10,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:11,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:11,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092003810] [2021-11-07 01:04:11,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092003810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:11,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:11,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 01:04:11,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780656061] [2021-11-07 01:04:11,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:04:11,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:04:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:04:11,111 INFO L87 Difference]: Start difference. First operand 778 states and 1492 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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) [2021-11-07 01:04:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:12,353 INFO L93 Difference]: Finished difference Result 1336 states and 2586 transitions. [2021-11-07 01:04:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:04:12,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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 25 [2021-11-07 01:04:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:12,355 INFO L225 Difference]: With dead ends: 1336 [2021-11-07 01:04:12,355 INFO L226 Difference]: Without dead ends: 1336 [2021-11-07 01:04:12,356 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:04:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2021-11-07 01:04:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 774. [2021-11-07 01:04:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 765 states have (on average 1.9398692810457516) internal successors, (1484), 773 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1484 transitions. [2021-11-07 01:04:12,366 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1484 transitions. Word has length 25 [2021-11-07 01:04:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:12,366 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1484 transitions. [2021-11-07 01:04:12,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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) [2021-11-07 01:04:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1484 transitions. [2021-11-07 01:04:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:12,366 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:12,367 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:12,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-11-07 01:04:12,367 INFO L402 AbstractCegarLoop]: === Iteration 164 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1130481088, now seen corresponding path program 16 times [2021-11-07 01:04:12,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:12,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187334881] [2021-11-07 01:04:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:12,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:12,644 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:12,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187334881] [2021-11-07 01:04:12,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187334881] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:12,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:12,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:04:12,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665977353] [2021-11-07 01:04:12,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 01:04:12,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 01:04:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:04:12,645 INFO L87 Difference]: Start difference. First operand 774 states and 1484 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:14,880 INFO L93 Difference]: Finished difference Result 1517 states and 2949 transitions. [2021-11-07 01:04:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-07 01:04:14,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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 25 [2021-11-07 01:04:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:14,882 INFO L225 Difference]: With dead ends: 1517 [2021-11-07 01:04:14,882 INFO L226 Difference]: Without dead ends: 1517 [2021-11-07 01:04:14,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2021-11-07 01:04:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-11-07 01:04:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 679. [2021-11-07 01:04:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 671 states have (on average 1.9359165424739195) internal successors, (1299), 678 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1299 transitions. [2021-11-07 01:04:14,894 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1299 transitions. Word has length 25 [2021-11-07 01:04:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:14,894 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 1299 transitions. [2021-11-07 01:04:14,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) [2021-11-07 01:04:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1299 transitions. [2021-11-07 01:04:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 01:04:14,895 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:14,895 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:14,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-11-07 01:04:14,895 INFO L402 AbstractCegarLoop]: === Iteration 165 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1390182648, now seen corresponding path program 1 times [2021-11-07 01:04:14,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:14,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480305767] [2021-11-07 01:04:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:14,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:14,977 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:14,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480305767] [2021-11-07 01:04:14,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480305767] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:14,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:14,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:04:14,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388630134] [2021-11-07 01:04:14,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:04:14,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:14,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:04:14,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:04:14,978 INFO L87 Difference]: Start difference. First operand 679 states and 1299 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:15,323 INFO L93 Difference]: Finished difference Result 754 states and 1437 transitions. [2021-11-07 01:04:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:04:15,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 01:04:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:15,325 INFO L225 Difference]: With dead ends: 754 [2021-11-07 01:04:15,325 INFO L226 Difference]: Without dead ends: 754 [2021-11-07 01:04:15,325 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:04:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-11-07 01:04:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 726. [2021-11-07 01:04:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 718 states have (on average 1.934540389972145) internal successors, (1389), 725 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1389 transitions. [2021-11-07 01:04:15,333 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1389 transitions. Word has length 27 [2021-11-07 01:04:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:15,333 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1389 transitions. [2021-11-07 01:04:15,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1389 transitions. [2021-11-07 01:04:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 01:04:15,334 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:15,334 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:15,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-11-07 01:04:15,334 INFO L402 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2021-11-07 01:04:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1447765978, now seen corresponding path program 1 times [2021-11-07 01:04:15,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:15,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398568557] [2021-11-07 01:04:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:15,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:04:15,373 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:04:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:04:15,471 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:04:15,471 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:04:15,472 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-07 01:04:15,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE [2021-11-07 01:04:15,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-11-07 01:04:15,482 INFO L731 BasicCegarLoop]: Path program histogram: [85, 28, 20, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:15,490 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-07 01:04:15,490 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:04:15,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:04:15 BasicIcfg [2021-11-07 01:04:15,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:04:15,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:04:15,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:04:15,576 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:04:15,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:57" (3/4) ... [2021-11-07 01:04:15,584 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 01:04:15,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:04:15,585 INFO L168 Benchmark]: Toolchain (without parser) took 560438.94 ms. Allocated memory was 98.6 MB in the beginning and 629.1 MB in the end (delta: 530.6 MB). Free memory was 61.9 MB in the beginning and 538.3 MB in the end (delta: -476.4 MB). Peak memory consumption was 54.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:15,585 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 98.6 MB. Free memory is still 49.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:04:15,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1206.28 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 61.6 MB in the beginning and 65.0 MB in the end (delta: -3.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:15,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 119.5 MB. Free memory was 65.0 MB in the beginning and 61.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:15,586 INFO L168 Benchmark]: Boogie Preprocessor took 43.60 ms. Allocated memory is still 119.5 MB. Free memory was 61.4 MB in the beginning and 58.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:15,586 INFO L168 Benchmark]: RCFGBuilder took 760.76 ms. Allocated memory is still 119.5 MB. Free memory was 58.7 MB in the beginning and 90.7 MB in the end (delta: -32.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:15,587 INFO L168 Benchmark]: TraceAbstraction took 558345.86 ms. Allocated memory was 119.5 MB in the beginning and 629.1 MB in the end (delta: 509.6 MB). Free memory was 89.9 MB in the beginning and 539.4 MB in the end (delta: -449.4 MB). Peak memory consumption was 60.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:15,587 INFO L168 Benchmark]: Witness Printer took 8.75 ms. Allocated memory is still 629.1 MB. Free memory was 539.4 MB in the beginning and 538.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:04:15,589 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 98.6 MB. Free memory is still 49.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1206.28 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 61.6 MB in the beginning and 65.0 MB in the end (delta: -3.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 119.5 MB. Free memory was 65.0 MB in the beginning and 61.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.60 ms. Allocated memory is still 119.5 MB. Free memory was 61.4 MB in the beginning and 58.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 760.76 ms. Allocated memory is still 119.5 MB. Free memory was 58.7 MB in the beginning and 90.7 MB in the end (delta: -32.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 558345.86 ms. Allocated memory was 119.5 MB in the beginning and 629.1 MB in the end (delta: 509.6 MB). Free memory was 89.9 MB in the beginning and 539.4 MB in the end (delta: -449.4 MB). Peak memory consumption was 60.7 MB. Max. memory is 16.1 GB. * Witness Printer took 8.75 ms. Allocated memory is still 629.1 MB. Free memory was 539.4 MB in the beginning and 538.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 229.7s, 199 PlacesBefore, 72 PlacesAfterwards, 195 TransitionsBefore, 68 TransitionsAfterwards, 4030 CoEnabledTransitionPairs, 21 FixpointIterations, 129 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 208 TotalNumberOfCompositions, 59784 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10646, positive: 8383, positive conditional: 0, positive unconditional: 8383, negative: 2263, negative conditional: 0, negative unconditional: 2263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3007, positive: 2857, positive conditional: 0, positive unconditional: 2857, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3007, positive: 2367, positive conditional: 0, positive unconditional: 2367, negative: 640, negative conditional: 0, negative unconditional: 640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 640, positive: 490, positive conditional: 0, positive unconditional: 490, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 772, positive: 401, positive conditional: 0, positive unconditional: 401, negative: 371, negative conditional: 0, negative unconditional: 371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10646, positive: 5526, positive conditional: 0, positive unconditional: 5526, negative: 2113, negative conditional: 0, negative unconditional: 2113, unknown: 3007, unknown conditional: 0, unknown unconditional: 3007] , Statistics on independence cache: Total cache size (in pairs): 499, Positive cache size: 401, Positive conditional cache size: 0, Positive unconditional cache size: 401, Negative cache size: 98, Negative conditional cache size: 0, Negative unconditional cache size: 98 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1253]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] 0 init(A,3) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1250] EXPR 0 A->next [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1253] EXPR 0 A->next VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1234] 1 struct s *p = malloc(sizeof(struct s)); [L1235] 1 struct s *t; [L1228] 1 p -> datum = x VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1253] EXPR 0 A->next VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1229] 1 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1253] 0 p = A->next VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1229] 1 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1253] 0 p = A->next VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1229] 1 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1238] EXPR 1 A->next [L1238] 1 t = A->next [L1239] EXPR 1 A->next [L1239] 1 A->next = p VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] [L1253] 0 p = A->next VAL [A={11:0}, A_mutex={14:0}, B_mutex={17:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: A->next = p [1250] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: A->next = p [1250] * C: A->next = p [1250] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: A->next = p [1239] * C: p -> next = ((void *)0) [1229] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1250] and C: p = A->next [1253] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 263 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 558.0s, OverallIterations: 166, TraceHistogramMax: 1, PathProgramHistogramMax: 85, EmptinessCheckTime: 0.1s, AutomataDifference: 223.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 229.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12629 SDtfs, 27516 SDslu, 36045 SDs, 0 SdLazy, 141405 SolverSat, 9247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 119.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4020 GetRequests, 5 SyntacticMatches, 437 SemanticMatches, 3578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16150 ImplicationChecksByTransitivity, 114.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1052occurred in iteration=50, InterpolantAutomatonStates: 2933, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 165 MinimizatonAttempts, 76005 StatesRemovedByMinimization, 162 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 96.2s InterpolantComputationTime, 3459 NumberOfCodeBlocks, 3459 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 3264 ConstructedInterpolants, 0 QuantifiedInterpolants, 131452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 165 InterpolantComputations, 165 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-07 01:04:15,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caf5b680-d845-439d-b2a8-76adb0fec88b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE