./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_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_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/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_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/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_aeee4187-69da-4e9e-a66c-a9a6f14f0991/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 a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:21:32,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:21:32,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:21:32,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:21:32,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:21:32,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:21:32,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:21:32,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:21:32,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:21:32,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:21:32,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:21:32,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:21:32,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:21:32,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:21:32,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:21:32,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:21:32,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:21:32,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:21:32,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:21:32,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:21:32,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:21:32,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:21:32,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:21:32,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:21:32,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:21:32,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:21:32,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:21:32,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:21:32,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:21:32,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:21:32,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:21:32,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:21:32,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:21:32,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:21:32,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:21:32,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:21:32,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:21:32,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:21:32,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:21:32,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:21:32,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:21:32,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-07 02:21:32,210 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:21:32,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:21:32,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:21:32,212 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:21:32,213 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:21:32,213 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:21:32,213 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:21:32,213 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:21:32,220 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:21:32,221 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:21:32,222 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:21:32,222 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:21:32,222 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:21:32,223 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:21:32,223 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:21:32,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:21:32,225 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:21:32,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 02:21:32,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:21:32,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:21:32,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:21:32,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:21:32,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:21:32,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:21:32,227 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-07 02:21:32,227 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:21:32,227 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:21:32,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:21:32,228 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:21:32,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:21:32,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:21:32,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:21:32,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:21:32,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:21:32,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:21:32,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:21:32,232 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:21:32,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:21:32,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:21:32,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:21:32,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:21:32,234 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_aeee4187-69da-4e9e-a66c-a9a6f14f0991/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_aeee4187-69da-4e9e-a66c-a9a6f14f0991/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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2021-11-07 02:21:32,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:21:32,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:21:32,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:21:32,570 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:21:32,571 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:21:32,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2021-11-07 02:21:32,662 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/data/d87bae140/d40ee425d6674ce69093ceb601c333e6/FLAGdb89e0264 [2021-11-07 02:21:33,398 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:21:33,399 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2021-11-07 02:21:33,430 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/data/d87bae140/d40ee425d6674ce69093ceb601c333e6/FLAGdb89e0264 [2021-11-07 02:21:33,661 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/data/d87bae140/d40ee425d6674ce69093ceb601c333e6 [2021-11-07 02:21:33,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:21:33,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:21:33,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:21:33,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:21:33,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:21:33,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:21:33" (1/1) ... [2021-11-07 02:21:33,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55144eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:33, skipping insertion in model container [2021-11-07 02:21:33,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:21:33" (1/1) ... [2021-11-07 02:21:33,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:21:33,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:21:34,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:21:34,366 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:21:34,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:21:34,534 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:21:34,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34 WrapperNode [2021-11-07 02:21:34,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:21:34,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:21:34,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:21:34,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:21:34,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:21:34,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:21:34,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:21:34,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:21:34,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:21:34,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:21:34,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:21:34,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:21:34,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (1/1) ... [2021-11-07 02:21:34,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:21:34,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:21:34,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:21:34,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aeee4187-69da-4e9e-a66c-a9a6f14f0991/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:21:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:21:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 02:21:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 02:21:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 02:21:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 02:21:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 02:21:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-07 02:21:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 02:21:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 02:21:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-07 02:21:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-07 02:21:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:21:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:21:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:21:34,804 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 02:21:35,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:21:35,613 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-11-07 02:21:35,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:21:35 BoogieIcfgContainer [2021-11-07 02:21:35,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:21:35,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:21:35,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:21:35,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:21:35,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:21:33" (1/3) ... [2021-11-07 02:21:35,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b52ac1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:21:35, skipping insertion in model container [2021-11-07 02:21:35,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:34" (2/3) ... [2021-11-07 02:21:35,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b52ac1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:21:35, skipping insertion in model container [2021-11-07 02:21:35,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:21:35" (3/3) ... [2021-11-07 02:21:35,625 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2021-11-07 02:21:35,632 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-07 02:21:35,632 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:21:35,632 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-11-07 02:21:35,633 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-07 02:21:35,691 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,692 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,692 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,693 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,693 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,694 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,694 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,694 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,695 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,695 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,695 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,695 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,696 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,696 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,697 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,697 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,698 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,698 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,698 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,698 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,699 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,700 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,700 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,701 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,701 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,701 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,702 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,702 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,703 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,703 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,703 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,704 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,704 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,704 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,705 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,705 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,705 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,705 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,706 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,706 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,706 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,707 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,707 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,707 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,708 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,708 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,708 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,708 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,708 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,708 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,709 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,709 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,709 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,709 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,710 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,711 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,713 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,714 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,714 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,715 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,715 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,715 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,715 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,715 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,715 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,721 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,722 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,722 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,722 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,722 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,722 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,723 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,723 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,723 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,723 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,723 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,723 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,724 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,725 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,725 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,725 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,725 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,726 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,726 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,726 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,726 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,726 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,726 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,726 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,727 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,727 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,727 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,727 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,727 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,727 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,728 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,728 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,728 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,728 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,728 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,728 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,729 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,729 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,729 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,729 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,729 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,729 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,729 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,730 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,730 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,730 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,730 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,730 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,731 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,731 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,731 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,731 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,731 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,731 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,732 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,732 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,732 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,732 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,732 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,733 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,734 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,734 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,736 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,736 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,737 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,737 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,738 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,738 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,738 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,739 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,739 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,739 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,740 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,740 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,740 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,740 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,741 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,741 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,743 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,743 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,743 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,744 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,744 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,752 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,753 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,753 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,754 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,754 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,754 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,754 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,754 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,757 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,757 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,757 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,757 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,758 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,758 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,759 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,759 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,759 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,759 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,760 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,760 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,760 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,760 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,762 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,762 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,762 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,767 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,767 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,767 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,768 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,768 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,768 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,768 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,769 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,770 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,770 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,770 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,770 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,770 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,770 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,770 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,771 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,771 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,771 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,771 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,772 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,772 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,772 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,772 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,773 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,773 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,773 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,773 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,774 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,774 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,774 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,774 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,774 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,775 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,775 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,775 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,775 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,776 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,776 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,776 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,776 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,777 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,778 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,779 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,779 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,779 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,780 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,780 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,780 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,780 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,781 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,781 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,781 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,781 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,781 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,781 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,782 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,783 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,783 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,783 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,783 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,784 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,784 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,784 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,785 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,785 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,785 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,786 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,786 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,786 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,786 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,787 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,787 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,787 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,788 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,788 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,789 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,789 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,789 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,789 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,789 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,790 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,790 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,790 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,790 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,791 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,791 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,791 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,791 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,792 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,792 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,825 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,825 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,825 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,825 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,825 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,826 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~list.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,826 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,827 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,828 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,828 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,828 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,829 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,829 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,829 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,829 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,829 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,830 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_insert_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_insert_#in~list.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:21:35,835 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-07 02:21:35,886 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:21:35,893 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 02:21:35,893 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-11-07 02:21:35,915 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-07 02:21:35,929 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 262 transitions, 529 flow [2021-11-07 02:21:35,932 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 262 transitions, 529 flow [2021-11-07 02:21:35,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 264 places, 262 transitions, 529 flow [2021-11-07 02:21:36,153 INFO L129 PetriNetUnfolder]: 2/261 cut-off events. [2021-11-07 02:21:36,155 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 02:21:36,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 261 events. 2/261 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2021-11-07 02:21:36,189 INFO L116 LiptonReduction]: Number of co-enabled transitions 17762 [2021-11-07 02:22:25,457 WARN L207 SmtUtils]: Spent 8.47 s on a formula simplification that was a NOOP. DAG size: 135 [2021-11-07 02:22:39,163 WARN L207 SmtUtils]: Spent 8.78 s on a formula simplification that was a NOOP. DAG size: 135 [2021-11-07 02:22:45,205 WARN L207 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 123 [2021-11-07 02:23:42,911 WARN L207 SmtUtils]: Spent 54.75 s on a formula simplification. DAG size of input: 260 DAG size of output: 252 [2021-11-07 02:23:58,709 WARN L207 SmtUtils]: Spent 15.79 s on a formula simplification that was a NOOP. DAG size: 236 [2021-11-07 02:24:44,751 WARN L207 SmtUtils]: Spent 46.04 s on a formula simplification. DAG size of input: 260 DAG size of output: 252 [2021-11-07 02:24:48,031 INFO L131 LiptonReduction]: Checked pairs total: 140485 [2021-11-07 02:24:48,031 INFO L133 LiptonReduction]: Total number of compositions: 152 [2021-11-07 02:24:48,039 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 133 places, 131 transitions, 267 flow [2021-11-07 02:24:48,147 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3797 states, 3713 states have (on average 2.0393213035281446) internal successors, (7572), 3796 states have internal predecessors, (7572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 3797 states, 3713 states have (on average 2.0393213035281446) internal successors, (7572), 3796 states have internal predecessors, (7572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-07 02:24:48,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:48,165 INFO L513 BasicCegarLoop]: trace histogram [1] [2021-11-07 02:24:48,165 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:24:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 800, now seen corresponding path program 1 times [2021-11-07 02:24:48,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:48,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340632287] [2021-11-07 02:24:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:48,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:48,284 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 02:24:48,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:48,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340632287] [2021-11-07 02:24:48,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340632287] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:48,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:48,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-07 02:24:48,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955184127] [2021-11-07 02:24:48,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 02:24:48,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 02:24:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 02:24:48,317 INFO L87 Difference]: Start difference. First operand has 3797 states, 3713 states have (on average 2.0393213035281446) internal successors, (7572), 3796 states have internal predecessors, (7572), 0 states have call successors, (0), 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 02:24:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:48,388 INFO L93 Difference]: Finished difference Result 3793 states and 7515 transitions. [2021-11-07 02:24:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 02:24:48,389 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 02:24:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:48,427 INFO L225 Difference]: With dead ends: 3793 [2021-11-07 02:24:48,427 INFO L226 Difference]: Without dead ends: 3791 [2021-11-07 02:24:48,428 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 02:24:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2021-11-07 02:24:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3791. [2021-11-07 02:24:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3791 states, 3712 states have (on average 2.0234375) internal successors, (7511), 3790 states have internal predecessors, (7511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 7511 transitions. [2021-11-07 02:24:48,667 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 7511 transitions. Word has length 1 [2021-11-07 02:24:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:48,668 INFO L470 AbstractCegarLoop]: Abstraction has 3791 states and 7511 transitions. [2021-11-07 02:24:48,668 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 02:24:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 7511 transitions. [2021-11-07 02:24:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 02:24:48,669 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:48,669 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:48,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:24:48,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:24:48,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2091329577, now seen corresponding path program 1 times [2021-11-07 02:24:48,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:48,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483209728] [2021-11-07 02:24:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:48,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:48,981 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 02:24:48,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:48,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483209728] [2021-11-07 02:24:48,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483209728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:48,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:48,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:48,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403352992] [2021-11-07 02:24:48,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:48,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:48,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:48,996 INFO L87 Difference]: Start difference. First operand 3791 states and 7511 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:50,066 INFO L93 Difference]: Finished difference Result 4048 states and 8020 transitions. [2021-11-07 02:24:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-11-07 02:24:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:50,095 INFO L225 Difference]: With dead ends: 4048 [2021-11-07 02:24:50,095 INFO L226 Difference]: Without dead ends: 4048 [2021-11-07 02:24:50,096 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 02:24:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2021-11-07 02:24:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3996. [2021-11-07 02:24:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3996 states, 3917 states have (on average 2.0211896859841714) internal successors, (7917), 3995 states have internal predecessors, (7917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 7917 transitions. [2021-11-07 02:24:50,240 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 7917 transitions. Word has length 8 [2021-11-07 02:24:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:50,241 INFO L470 AbstractCegarLoop]: Abstraction has 3996 states and 7917 transitions. [2021-11-07 02:24:50,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 7917 transitions. [2021-11-07 02:24:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:24:50,242 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:50,242 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:50,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:24:50,243 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:24:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash -113964250, now seen corresponding path program 1 times [2021-11-07 02:24:50,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:50,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916612186] [2021-11-07 02:24:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:50,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:50,373 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 02:24:50,373 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:50,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916612186] [2021-11-07 02:24:50,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916612186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:50,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:50,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:50,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716897441] [2021-11-07 02:24:50,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:50,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:50,376 INFO L87 Difference]: Start difference. First operand 3996 states and 7917 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 02:24:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:51,561 INFO L93 Difference]: Finished difference Result 4261 states and 8447 transitions. [2021-11-07 02:24:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:51,561 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 02:24:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:51,590 INFO L225 Difference]: With dead ends: 4261 [2021-11-07 02:24:51,617 INFO L226 Difference]: Without dead ends: 4261 [2021-11-07 02:24:51,617 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 02:24:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2021-11-07 02:24:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 4261. [2021-11-07 02:24:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 4182 states have (on average 2.0198469631755143) internal successors, (8447), 4260 states have internal predecessors, (8447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 8447 transitions. [2021-11-07 02:24:51,839 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 8447 transitions. Word has length 9 [2021-11-07 02:24:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:51,840 INFO L470 AbstractCegarLoop]: Abstraction has 4261 states and 8447 transitions. [2021-11-07 02:24:51,840 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 02:24:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 8447 transitions. [2021-11-07 02:24:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:24:51,842 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:51,843 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:51,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:24:51,843 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:24:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2145250684, now seen corresponding path program 1 times [2021-11-07 02:24:51,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:51,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211663450] [2021-11-07 02:24:51,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:51,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:52,140 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 02:24:52,140 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:52,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211663450] [2021-11-07 02:24:52,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211663450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:52,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:52,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:24:52,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405480366] [2021-11-07 02:24:52,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:24:52,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:24:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:24:52,142 INFO L87 Difference]: Start difference. First operand 4261 states and 8447 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:54,238 INFO L93 Difference]: Finished difference Result 4328 states and 8528 transitions. [2021-11-07 02:24:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 02:24:54,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:24:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:54,278 INFO L225 Difference]: With dead ends: 4328 [2021-11-07 02:24:54,278 INFO L226 Difference]: Without dead ends: 4328 [2021-11-07 02:24:54,279 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:24:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2021-11-07 02:24:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 4271. [2021-11-07 02:24:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 4192 states have (on average 2.0197996183206106) internal successors, (8467), 4270 states have internal predecessors, (8467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 8467 transitions. [2021-11-07 02:24:54,404 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 8467 transitions. Word has length 11 [2021-11-07 02:24:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:54,405 INFO L470 AbstractCegarLoop]: Abstraction has 4271 states and 8467 transitions. [2021-11-07 02:24:54,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 8467 transitions. [2021-11-07 02:24:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:24:54,407 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:54,408 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:54,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:24:54,409 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:24:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2139415864, now seen corresponding path program 2 times [2021-11-07 02:24:54,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:54,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379998888] [2021-11-07 02:24:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:54,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:54,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 02:24:54,673 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:54,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379998888] [2021-11-07 02:24:54,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379998888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:54,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:54,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:24:54,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44987979] [2021-11-07 02:24:54,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:24:54,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:24:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:24:54,675 INFO L87 Difference]: Start difference. First operand 4271 states and 8467 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:57,152 INFO L93 Difference]: Finished difference Result 4364 states and 8599 transitions. [2021-11-07 02:24:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:24:57,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:24:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:57,182 INFO L225 Difference]: With dead ends: 4364 [2021-11-07 02:24:57,182 INFO L226 Difference]: Without dead ends: 4364 [2021-11-07 02:24:57,182 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:24:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2021-11-07 02:24:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 4285. [2021-11-07 02:24:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 4206 states have (on average 2.0199714693295294) internal successors, (8496), 4284 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 8496 transitions. [2021-11-07 02:24:57,299 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 8496 transitions. Word has length 11 [2021-11-07 02:24:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:57,299 INFO L470 AbstractCegarLoop]: Abstraction has 4285 states and 8496 transitions. [2021-11-07 02:24:57,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 8496 transitions. [2021-11-07 02:24:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:24:57,301 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:57,301 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:57,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:24:57,302 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:24:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1957613884, now seen corresponding path program 3 times [2021-11-07 02:24:57,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:57,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212751670] [2021-11-07 02:24:57,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:57,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:57,498 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 02:24:57,498 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:57,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212751670] [2021-11-07 02:24:57,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212751670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:57,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:57,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:24:57,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908008426] [2021-11-07 02:24:57,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:24:57,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:24:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:24:57,500 INFO L87 Difference]: Start difference. First operand 4285 states and 8496 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:59,651 INFO L93 Difference]: Finished difference Result 4405 states and 8680 transitions. [2021-11-07 02:24:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:24:59,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:24:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:59,667 INFO L225 Difference]: With dead ends: 4405 [2021-11-07 02:24:59,667 INFO L226 Difference]: Without dead ends: 4405 [2021-11-07 02:24:59,668 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:24:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2021-11-07 02:24:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 4299. [2021-11-07 02:24:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4299 states, 4220 states have (on average 2.0201421800947865) internal successors, (8525), 4298 states have internal predecessors, (8525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 8525 transitions. [2021-11-07 02:24:59,782 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 8525 transitions. Word has length 11 [2021-11-07 02:24:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:59,783 INFO L470 AbstractCegarLoop]: Abstraction has 4299 states and 8525 transitions. [2021-11-07 02:24:59,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 8525 transitions. [2021-11-07 02:24:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:24:59,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:59,784 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:59,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:24:59,785 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:24:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -588120440, now seen corresponding path program 4 times [2021-11-07 02:24:59,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:59,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834289230] [2021-11-07 02:24:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:59,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:59,937 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 02:24:59,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:59,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834289230] [2021-11-07 02:24:59,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834289230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:59,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:59,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:24:59,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422313457] [2021-11-07 02:24:59,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:24:59,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:24:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:24:59,939 INFO L87 Difference]: Start difference. First operand 4299 states and 8525 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:01,822 INFO L93 Difference]: Finished difference Result 4442 states and 8757 transitions. [2021-11-07 02:25:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:25:01,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:01,832 INFO L225 Difference]: With dead ends: 4442 [2021-11-07 02:25:01,833 INFO L226 Difference]: Without dead ends: 4442 [2021-11-07 02:25:01,833 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:25:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2021-11-07 02:25:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4313. [2021-11-07 02:25:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 4234 states have (on average 2.0203117619272555) internal successors, (8554), 4312 states have internal predecessors, (8554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 8554 transitions. [2021-11-07 02:25:01,969 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 8554 transitions. Word has length 11 [2021-11-07 02:25:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:01,969 INFO L470 AbstractCegarLoop]: Abstraction has 4313 states and 8554 transitions. [2021-11-07 02:25:01,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 8554 transitions. [2021-11-07 02:25:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:01,971 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:01,971 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:01,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:25:01,971 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2028025340, now seen corresponding path program 1 times [2021-11-07 02:25:01,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:01,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761335936] [2021-11-07 02:25:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:01,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:02,149 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 02:25:02,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:02,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761335936] [2021-11-07 02:25:02,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761335936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:02,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:02,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:02,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664882532] [2021-11-07 02:25:02,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:02,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:02,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:02,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:02,151 INFO L87 Difference]: Start difference. First operand 4313 states and 8554 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:03,672 INFO L93 Difference]: Finished difference Result 8508 states and 16815 transitions. [2021-11-07 02:25:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:25:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:03,698 INFO L225 Difference]: With dead ends: 8508 [2021-11-07 02:25:03,698 INFO L226 Difference]: Without dead ends: 8508 [2021-11-07 02:25:03,699 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:25:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2021-11-07 02:25:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 4367. [2021-11-07 02:25:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4367 states, 4288 states have (on average 2.0202891791044775) internal successors, (8663), 4366 states have internal predecessors, (8663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 8663 transitions. [2021-11-07 02:25:03,884 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 8663 transitions. Word has length 11 [2021-11-07 02:25:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:03,887 INFO L470 AbstractCegarLoop]: Abstraction has 4367 states and 8663 transitions. [2021-11-07 02:25:03,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 8663 transitions. [2021-11-07 02:25:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:03,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:03,889 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:03,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:25:03,890 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1975420938, now seen corresponding path program 5 times [2021-11-07 02:25:03,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:03,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434200316] [2021-11-07 02:25:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:03,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:04,070 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 02:25:04,070 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:04,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434200316] [2021-11-07 02:25:04,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434200316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:04,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:04,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:04,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10082976] [2021-11-07 02:25:04,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:04,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:04,072 INFO L87 Difference]: Start difference. First operand 4367 states and 8663 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:06,152 INFO L93 Difference]: Finished difference Result 8331 states and 16463 transitions. [2021-11-07 02:25:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:25:06,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:06,176 INFO L225 Difference]: With dead ends: 8331 [2021-11-07 02:25:06,176 INFO L226 Difference]: Without dead ends: 8331 [2021-11-07 02:25:06,176 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:25:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8331 states. [2021-11-07 02:25:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8331 to 4336. [2021-11-07 02:25:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4336 states, 4257 states have (on average 2.019497298567066) internal successors, (8597), 4335 states have internal predecessors, (8597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4336 states to 4336 states and 8597 transitions. [2021-11-07 02:25:06,308 INFO L78 Accepts]: Start accepts. Automaton has 4336 states and 8597 transitions. Word has length 11 [2021-11-07 02:25:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:06,309 INFO L470 AbstractCegarLoop]: Abstraction has 4336 states and 8597 transitions. [2021-11-07 02:25:06,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4336 states and 8597 transitions. [2021-11-07 02:25:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:06,310 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:06,310 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:06,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:25:06,311 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:06,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1992134212, now seen corresponding path program 2 times [2021-11-07 02:25:06,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:06,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902165920] [2021-11-07 02:25:06,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:06,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:06,561 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 02:25:06,561 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:06,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902165920] [2021-11-07 02:25:06,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902165920] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:06,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:06,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:06,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739071686] [2021-11-07 02:25:06,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:06,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:06,563 INFO L87 Difference]: Start difference. First operand 4336 states and 8597 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:08,259 INFO L93 Difference]: Finished difference Result 8750 states and 17299 transitions. [2021-11-07 02:25:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:25:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:08,282 INFO L225 Difference]: With dead ends: 8750 [2021-11-07 02:25:08,282 INFO L226 Difference]: Without dead ends: 8750 [2021-11-07 02:25:08,283 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:25:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8750 states. [2021-11-07 02:25:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8750 to 4355. [2021-11-07 02:25:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4355 states, 4276 states have (on average 2.019644527595884) internal successors, (8636), 4354 states have internal predecessors, (8636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 8636 transitions. [2021-11-07 02:25:08,397 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 8636 transitions. Word has length 11 [2021-11-07 02:25:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:08,398 INFO L470 AbstractCegarLoop]: Abstraction has 4355 states and 8636 transitions. [2021-11-07 02:25:08,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 8636 transitions. [2021-11-07 02:25:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:08,399 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:08,399 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:08,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:25:08,399 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1972152984, now seen corresponding path program 3 times [2021-11-07 02:25:08,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:08,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759938568] [2021-11-07 02:25:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:08,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:08,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 02:25:08,577 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:08,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759938568] [2021-11-07 02:25:08,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759938568] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:08,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:08,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:08,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122218901] [2021-11-07 02:25:08,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:08,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:08,579 INFO L87 Difference]: Start difference. First operand 4355 states and 8636 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:10,320 INFO L93 Difference]: Finished difference Result 8805 states and 17409 transitions. [2021-11-07 02:25:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:25:10,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:10,385 INFO L225 Difference]: With dead ends: 8805 [2021-11-07 02:25:10,386 INFO L226 Difference]: Without dead ends: 8805 [2021-11-07 02:25:10,386 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:25:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2021-11-07 02:25:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 4364. [2021-11-07 02:25:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4364 states, 4285 states have (on average 2.0198366394399065) internal successors, (8655), 4363 states have internal predecessors, (8655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 8655 transitions. [2021-11-07 02:25:10,521 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 8655 transitions. Word has length 11 [2021-11-07 02:25:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:10,521 INFO L470 AbstractCegarLoop]: Abstraction has 4364 states and 8655 transitions. [2021-11-07 02:25:10,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 8655 transitions. [2021-11-07 02:25:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:10,522 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:10,522 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:10,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:25:10,523 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1252995896, now seen corresponding path program 4 times [2021-11-07 02:25:10,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:10,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545895682] [2021-11-07 02:25:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:10,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:10,717 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 02:25:10,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:10,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545895682] [2021-11-07 02:25:10,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545895682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:10,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:10,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:10,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703558465] [2021-11-07 02:25:10,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:10,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:10,719 INFO L87 Difference]: Start difference. First operand 4364 states and 8655 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:12,499 INFO L93 Difference]: Finished difference Result 8845 states and 17489 transitions. [2021-11-07 02:25:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:25:12,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:12,518 INFO L225 Difference]: With dead ends: 8845 [2021-11-07 02:25:12,518 INFO L226 Difference]: Without dead ends: 8845 [2021-11-07 02:25:12,518 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:25:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8845 states. [2021-11-07 02:25:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8845 to 4373. [2021-11-07 02:25:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4373 states, 4294 states have (on average 2.0200279459711226) internal successors, (8674), 4372 states have internal predecessors, (8674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 8674 transitions. [2021-11-07 02:25:12,634 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 8674 transitions. Word has length 11 [2021-11-07 02:25:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:12,634 INFO L470 AbstractCegarLoop]: Abstraction has 4373 states and 8674 transitions. [2021-11-07 02:25:12,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 8674 transitions. [2021-11-07 02:25:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:12,635 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:12,635 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:12,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:25:12,635 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:12,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2120195470, now seen corresponding path program 5 times [2021-11-07 02:25:12,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:12,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053657473] [2021-11-07 02:25:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:12,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:12,812 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 02:25:12,812 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:12,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053657473] [2021-11-07 02:25:12,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053657473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:12,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:12,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:12,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433944227] [2021-11-07 02:25:12,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:12,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:12,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:12,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:12,814 INFO L87 Difference]: Start difference. First operand 4373 states and 8674 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:14,324 INFO L93 Difference]: Finished difference Result 12572 states and 24870 transitions. [2021-11-07 02:25:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:25:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:14,342 INFO L225 Difference]: With dead ends: 12572 [2021-11-07 02:25:14,342 INFO L226 Difference]: Without dead ends: 12572 [2021-11-07 02:25:14,343 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:25:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2021-11-07 02:25:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 4382. [2021-11-07 02:25:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4303 states have (on average 2.0202184522426214) internal successors, (8693), 4381 states have internal predecessors, (8693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 8693 transitions. [2021-11-07 02:25:14,529 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 8693 transitions. Word has length 11 [2021-11-07 02:25:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:14,530 INFO L470 AbstractCegarLoop]: Abstraction has 4382 states and 8693 transitions. [2021-11-07 02:25:14,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 8693 transitions. [2021-11-07 02:25:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:14,531 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:14,531 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:14,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 02:25:14,531 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1883250808, now seen corresponding path program 6 times [2021-11-07 02:25:14,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:14,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431756786] [2021-11-07 02:25:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:14,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:14,663 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 02:25:14,664 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:14,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431756786] [2021-11-07 02:25:14,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431756786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:14,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:14,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:14,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128774010] [2021-11-07 02:25:14,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:14,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:14,665 INFO L87 Difference]: Start difference. First operand 4382 states and 8693 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:17,996 INFO L93 Difference]: Finished difference Result 12337 states and 24403 transitions. [2021-11-07 02:25:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-07 02:25:17,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:18,024 INFO L225 Difference]: With dead ends: 12337 [2021-11-07 02:25:18,024 INFO L226 Difference]: Without dead ends: 12337 [2021-11-07 02:25:18,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 02:25:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12337 states. [2021-11-07 02:25:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12337 to 4346. [2021-11-07 02:25:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4346 states, 4267 states have (on average 2.0194516053433325) internal successors, (8617), 4345 states have internal predecessors, (8617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 8617 transitions. [2021-11-07 02:25:18,157 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 8617 transitions. Word has length 11 [2021-11-07 02:25:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:18,157 INFO L470 AbstractCegarLoop]: Abstraction has 4346 states and 8617 transitions. [2021-11-07 02:25:18,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 8617 transitions. [2021-11-07 02:25:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:18,158 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:18,159 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:18,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:25:18,159 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:18,160 INFO L85 PathProgramCache]: Analyzing trace with hash 3676704, now seen corresponding path program 6 times [2021-11-07 02:25:18,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:18,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564260633] [2021-11-07 02:25:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:18,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:18,379 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 02:25:18,379 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:18,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564260633] [2021-11-07 02:25:18,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564260633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:18,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:18,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:18,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55866546] [2021-11-07 02:25:18,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:18,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:18,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:18,381 INFO L87 Difference]: Start difference. First operand 4346 states and 8617 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:19,891 INFO L93 Difference]: Finished difference Result 4493 states and 8910 transitions. [2021-11-07 02:25:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:25:19,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:19,898 INFO L225 Difference]: With dead ends: 4493 [2021-11-07 02:25:19,898 INFO L226 Difference]: Without dead ends: 4493 [2021-11-07 02:25:19,898 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:25:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2021-11-07 02:25:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 4352. [2021-11-07 02:25:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4352 states, 4273 states have (on average 2.019424292066464) internal successors, (8629), 4351 states have internal predecessors, (8629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 8629 transitions. [2021-11-07 02:25:19,981 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 8629 transitions. Word has length 11 [2021-11-07 02:25:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:19,981 INFO L470 AbstractCegarLoop]: Abstraction has 4352 states and 8629 transitions. [2021-11-07 02:25:19,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 8629 transitions. [2021-11-07 02:25:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:19,982 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:19,983 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:19,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 02:25:19,983 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 254094084, now seen corresponding path program 7 times [2021-11-07 02:25:19,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:19,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280528536] [2021-11-07 02:25:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:19,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:20,178 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 02:25:20,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:20,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280528536] [2021-11-07 02:25:20,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280528536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:20,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:20,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:20,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331691994] [2021-11-07 02:25:20,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:20,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:20,180 INFO L87 Difference]: Start difference. First operand 4352 states and 8629 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:21,719 INFO L93 Difference]: Finished difference Result 4535 states and 8994 transitions. [2021-11-07 02:25:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:21,726 INFO L225 Difference]: With dead ends: 4535 [2021-11-07 02:25:21,726 INFO L226 Difference]: Without dead ends: 4535 [2021-11-07 02:25:21,726 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-07 02:25:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2021-11-07 02:25:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4362. [2021-11-07 02:25:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4362 states, 4283 states have (on average 2.0196124212000934) internal successors, (8650), 4361 states have internal predecessors, (8650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4362 states to 4362 states and 8650 transitions. [2021-11-07 02:25:21,800 INFO L78 Accepts]: Start accepts. Automaton has 4362 states and 8650 transitions. Word has length 11 [2021-11-07 02:25:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:21,801 INFO L470 AbstractCegarLoop]: Abstraction has 4362 states and 8650 transitions. [2021-11-07 02:25:21,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 8650 transitions. [2021-11-07 02:25:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:21,802 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:21,802 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:21,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 02:25:21,802 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1881023364, now seen corresponding path program 8 times [2021-11-07 02:25:21,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:21,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613707665] [2021-11-07 02:25:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:21,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:21,992 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 02:25:21,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:21,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613707665] [2021-11-07 02:25:21,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613707665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:21,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:21,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:21,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693150058] [2021-11-07 02:25:21,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:21,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:21,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:21,994 INFO L87 Difference]: Start difference. First operand 4362 states and 8650 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:23,304 INFO L93 Difference]: Finished difference Result 4541 states and 9006 transitions. [2021-11-07 02:25:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:23,313 INFO L225 Difference]: With dead ends: 4541 [2021-11-07 02:25:23,314 INFO L226 Difference]: Without dead ends: 4541 [2021-11-07 02:25:23,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:25:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2021-11-07 02:25:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 4363. [2021-11-07 02:25:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4363 states, 4284 states have (on average 2.019607843137255) internal successors, (8652), 4362 states have internal predecessors, (8652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 8652 transitions. [2021-11-07 02:25:23,408 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 8652 transitions. Word has length 11 [2021-11-07 02:25:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:23,409 INFO L470 AbstractCegarLoop]: Abstraction has 4363 states and 8652 transitions. [2021-11-07 02:25:23,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 8652 transitions. [2021-11-07 02:25:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:23,410 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:23,410 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:23,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 02:25:23,410 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1550343264, now seen corresponding path program 9 times [2021-11-07 02:25:23,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:23,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856497603] [2021-11-07 02:25:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:23,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:23,627 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 02:25:23,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:23,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856497603] [2021-11-07 02:25:23,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856497603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:23,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:23,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:23,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962272342] [2021-11-07 02:25:23,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:23,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:23,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:23,629 INFO L87 Difference]: Start difference. First operand 4363 states and 8652 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:24,835 INFO L93 Difference]: Finished difference Result 4575 states and 9074 transitions. [2021-11-07 02:25:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:24,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:24,842 INFO L225 Difference]: With dead ends: 4575 [2021-11-07 02:25:24,842 INFO L226 Difference]: Without dead ends: 4575 [2021-11-07 02:25:24,842 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:25:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2021-11-07 02:25:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4372. [2021-11-07 02:25:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 4293 states have (on average 2.019799673887724) internal successors, (8671), 4371 states have internal predecessors, (8671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 8671 transitions. [2021-11-07 02:25:24,893 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 8671 transitions. Word has length 11 [2021-11-07 02:25:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:24,893 INFO L470 AbstractCegarLoop]: Abstraction has 4372 states and 8671 transitions. [2021-11-07 02:25:24,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 8671 transitions. [2021-11-07 02:25:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:24,894 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:24,894 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:24,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 02:25:24,894 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1512849536, now seen corresponding path program 10 times [2021-11-07 02:25:24,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:24,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488692820] [2021-11-07 02:25:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:24,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:25,094 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 02:25:25,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:25,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488692820] [2021-11-07 02:25:25,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488692820] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:25,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:25,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:25,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683894011] [2021-11-07 02:25:25,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:25,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:25,096 INFO L87 Difference]: Start difference. First operand 4372 states and 8671 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:26,348 INFO L93 Difference]: Finished difference Result 4554 states and 9032 transitions. [2021-11-07 02:25:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:26,355 INFO L225 Difference]: With dead ends: 4554 [2021-11-07 02:25:26,356 INFO L226 Difference]: Without dead ends: 4554 [2021-11-07 02:25:26,356 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:25:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2021-11-07 02:25:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4374. [2021-11-07 02:25:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4374 states, 4295 states have (on average 2.019790454016298) internal successors, (8675), 4373 states have internal predecessors, (8675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 8675 transitions. [2021-11-07 02:25:26,449 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 8675 transitions. Word has length 11 [2021-11-07 02:25:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:26,450 INFO L470 AbstractCegarLoop]: Abstraction has 4374 states and 8675 transitions. [2021-11-07 02:25:26,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 8675 transitions. [2021-11-07 02:25:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:26,451 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:26,451 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:26,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 02:25:26,451 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1843529636, now seen corresponding path program 11 times [2021-11-07 02:25:26,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:26,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277855496] [2021-11-07 02:25:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:26,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:26,625 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 02:25:26,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:26,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277855496] [2021-11-07 02:25:26,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277855496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:26,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:26,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:26,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38150252] [2021-11-07 02:25:26,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:26,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:26,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:26,627 INFO L87 Difference]: Start difference. First operand 4374 states and 8675 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:28,036 INFO L93 Difference]: Finished difference Result 4609 states and 9142 transitions. [2021-11-07 02:25:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:28,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:28,041 INFO L225 Difference]: With dead ends: 4609 [2021-11-07 02:25:28,041 INFO L226 Difference]: Without dead ends: 4609 [2021-11-07 02:25:28,042 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:25:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2021-11-07 02:25:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4373. [2021-11-07 02:25:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4373 states, 4294 states have (on average 2.019795062878435) internal successors, (8673), 4372 states have internal predecessors, (8673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 8673 transitions. [2021-11-07 02:25:28,097 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 8673 transitions. Word has length 11 [2021-11-07 02:25:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:28,097 INFO L470 AbstractCegarLoop]: Abstraction has 4373 states and 8673 transitions. [2021-11-07 02:25:28,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 8673 transitions. [2021-11-07 02:25:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:28,098 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:28,098 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:28,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 02:25:28,098 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1732280572, now seen corresponding path program 12 times [2021-11-07 02:25:28,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:28,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841663294] [2021-11-07 02:25:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:28,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:28,284 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 02:25:28,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:28,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841663294] [2021-11-07 02:25:28,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841663294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:28,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:28,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:28,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729376754] [2021-11-07 02:25:28,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:28,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:28,286 INFO L87 Difference]: Start difference. First operand 4373 states and 8673 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:29,605 INFO L93 Difference]: Finished difference Result 4616 states and 9156 transitions. [2021-11-07 02:25:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:29,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:29,610 INFO L225 Difference]: With dead ends: 4616 [2021-11-07 02:25:29,611 INFO L226 Difference]: Without dead ends: 4616 [2021-11-07 02:25:29,611 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:25:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4616 states. [2021-11-07 02:25:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4616 to 4382. [2021-11-07 02:25:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4303 states have (on average 2.0199860562398326) internal successors, (8692), 4381 states have internal predecessors, (8692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 8692 transitions. [2021-11-07 02:25:29,661 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 8692 transitions. Word has length 11 [2021-11-07 02:25:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:29,662 INFO L470 AbstractCegarLoop]: Abstraction has 4382 states and 8692 transitions. [2021-11-07 02:25:29,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 8692 transitions. [2021-11-07 02:25:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:29,663 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:29,663 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:29,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 02:25:29,663 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1384882894, now seen corresponding path program 13 times [2021-11-07 02:25:29,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:29,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623767975] [2021-11-07 02:25:29,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:29,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:29,837 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 02:25:29,837 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:29,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623767975] [2021-11-07 02:25:29,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623767975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:29,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:29,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:29,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215924710] [2021-11-07 02:25:29,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:29,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:29,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:29,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:29,838 INFO L87 Difference]: Start difference. First operand 4382 states and 8692 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:31,437 INFO L93 Difference]: Finished difference Result 8491 states and 16833 transitions. [2021-11-07 02:25:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:25:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:31,448 INFO L225 Difference]: With dead ends: 8491 [2021-11-07 02:25:31,448 INFO L226 Difference]: Without dead ends: 8491 [2021-11-07 02:25:31,449 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:25:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2021-11-07 02:25:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 4380. [2021-11-07 02:25:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 4301 states have (on average 2.0199953499186236) internal successors, (8688), 4379 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 8688 transitions. [2021-11-07 02:25:31,530 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 8688 transitions. Word has length 11 [2021-11-07 02:25:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:31,530 INFO L470 AbstractCegarLoop]: Abstraction has 4380 states and 8688 transitions. [2021-11-07 02:25:31,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 8688 transitions. [2021-11-07 02:25:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:31,531 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:31,531 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:31,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 02:25:31,531 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1054202794, now seen corresponding path program 14 times [2021-11-07 02:25:31,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:31,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391783761] [2021-11-07 02:25:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:31,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:31,718 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 02:25:31,719 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:31,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391783761] [2021-11-07 02:25:31,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391783761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:31,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:31,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:31,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456252697] [2021-11-07 02:25:31,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:31,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:31,720 INFO L87 Difference]: Start difference. First operand 4380 states and 8688 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:33,252 INFO L93 Difference]: Finished difference Result 8546 states and 16943 transitions. [2021-11-07 02:25:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:25:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:33,264 INFO L225 Difference]: With dead ends: 8546 [2021-11-07 02:25:33,264 INFO L226 Difference]: Without dead ends: 8546 [2021-11-07 02:25:33,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:25:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8546 states. [2021-11-07 02:25:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8546 to 4379. [2021-11-07 02:25:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4379 states, 4300 states have (on average 2.02) internal successors, (8686), 4378 states have internal predecessors, (8686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4379 states to 4379 states and 8686 transitions. [2021-11-07 02:25:33,348 INFO L78 Accepts]: Start accepts. Automaton has 4379 states and 8686 transitions. Word has length 11 [2021-11-07 02:25:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:33,348 INFO L470 AbstractCegarLoop]: Abstraction has 4379 states and 8686 transitions. [2021-11-07 02:25:33,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4379 states and 8686 transitions. [2021-11-07 02:25:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:33,349 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:33,349 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:33,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 02:25:33,350 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash -335045706, now seen corresponding path program 15 times [2021-11-07 02:25:33,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:33,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77277054] [2021-11-07 02:25:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:33,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:33,526 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 02:25:33,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:33,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77277054] [2021-11-07 02:25:33,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77277054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:33,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:33,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:33,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584775383] [2021-11-07 02:25:33,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:33,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:33,528 INFO L87 Difference]: Start difference. First operand 4379 states and 8686 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:34,936 INFO L93 Difference]: Finished difference Result 8586 states and 17023 transitions. [2021-11-07 02:25:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:25:34,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:34,946 INFO L225 Difference]: With dead ends: 8586 [2021-11-07 02:25:34,946 INFO L226 Difference]: Without dead ends: 8586 [2021-11-07 02:25:34,946 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:25:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8586 states. [2021-11-07 02:25:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8586 to 4378. [2021-11-07 02:25:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4378 states, 4299 states have (on average 2.020004652244708) internal successors, (8684), 4377 states have internal predecessors, (8684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 8684 transitions. [2021-11-07 02:25:35,051 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 8684 transitions. Word has length 11 [2021-11-07 02:25:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:35,052 INFO L470 AbstractCegarLoop]: Abstraction has 4378 states and 8684 transitions. [2021-11-07 02:25:35,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 8684 transitions. [2021-11-07 02:25:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:35,053 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:35,053 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:35,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 02:25:35,053 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1202245280, now seen corresponding path program 16 times [2021-11-07 02:25:35,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:35,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699103807] [2021-11-07 02:25:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:35,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:35,211 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 02:25:35,211 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:35,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699103807] [2021-11-07 02:25:35,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699103807] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:35,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:35,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:35,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893027385] [2021-11-07 02:25:35,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:35,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:35,213 INFO L87 Difference]: Start difference. First operand 4378 states and 8684 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:36,451 INFO L93 Difference]: Finished difference Result 8395 states and 16641 transitions. [2021-11-07 02:25:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:25:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:36,466 INFO L225 Difference]: With dead ends: 8395 [2021-11-07 02:25:36,467 INFO L226 Difference]: Without dead ends: 8395 [2021-11-07 02:25:36,467 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:25:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2021-11-07 02:25:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 4243. [2021-11-07 02:25:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4243 states, 4166 states have (on average 2.018963034085454) internal successors, (8411), 4242 states have internal predecessors, (8411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4243 states to 4243 states and 8411 transitions. [2021-11-07 02:25:36,544 INFO L78 Accepts]: Start accepts. Automaton has 4243 states and 8411 transitions. Word has length 11 [2021-11-07 02:25:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:36,544 INFO L470 AbstractCegarLoop]: Abstraction has 4243 states and 8411 transitions. [2021-11-07 02:25:36,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 8411 transitions. [2021-11-07 02:25:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:25:36,545 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:36,546 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:36,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 02:25:36,546 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1493766298, now seen corresponding path program 7 times [2021-11-07 02:25:36,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:36,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971082149] [2021-11-07 02:25:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:36,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:36,690 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 02:25:36,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:36,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971082149] [2021-11-07 02:25:36,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971082149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:36,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:36,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:36,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902580402] [2021-11-07 02:25:36,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:36,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:36,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:36,691 INFO L87 Difference]: Start difference. First operand 4243 states and 8411 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:38,909 INFO L93 Difference]: Finished difference Result 8215 states and 16283 transitions. [2021-11-07 02:25:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 02:25:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:25:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:38,918 INFO L225 Difference]: With dead ends: 8215 [2021-11-07 02:25:38,918 INFO L226 Difference]: Without dead ends: 8215 [2021-11-07 02:25:38,919 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:25:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8215 states. [2021-11-07 02:25:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8215 to 4113. [2021-11-07 02:25:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4113 states, 4037 states have (on average 2.019073569482289) internal successors, (8151), 4112 states have internal predecessors, (8151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 8151 transitions. [2021-11-07 02:25:38,995 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 8151 transitions. Word has length 11 [2021-11-07 02:25:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:38,996 INFO L470 AbstractCegarLoop]: Abstraction has 4113 states and 8151 transitions. [2021-11-07 02:25:38,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 8151 transitions. [2021-11-07 02:25:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 02:25:38,997 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:38,997 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:38,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 02:25:38,997 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:38,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:38,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1761088011, now seen corresponding path program 1 times [2021-11-07 02:25:38,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:38,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942135522] [2021-11-07 02:25:38,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:38,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:39,094 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 02:25:39,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:39,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942135522] [2021-11-07 02:25:39,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942135522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:39,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:39,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:25:39,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331798335] [2021-11-07 02:25:39,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:25:39,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:39,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:25:39,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:25:39,096 INFO L87 Difference]: Start difference. First operand 4113 states and 8151 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:40,027 INFO L93 Difference]: Finished difference Result 4314 states and 8549 transitions. [2021-11-07 02:25:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:25:40,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-07 02:25:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:40,033 INFO L225 Difference]: With dead ends: 4314 [2021-11-07 02:25:40,033 INFO L226 Difference]: Without dead ends: 4314 [2021-11-07 02:25:40,033 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 02:25:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2021-11-07 02:25:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4314. [2021-11-07 02:25:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 4238 states have (on average 2.0172251061821616) internal successors, (8549), 4313 states have internal predecessors, (8549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 8549 transitions. [2021-11-07 02:25:40,105 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 8549 transitions. Word has length 14 [2021-11-07 02:25:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:40,105 INFO L470 AbstractCegarLoop]: Abstraction has 4314 states and 8549 transitions. [2021-11-07 02:25:40,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 8549 transitions. [2021-11-07 02:25:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:25:40,106 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:40,106 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:40,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 02:25:40,106 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash -25586423, now seen corresponding path program 1 times [2021-11-07 02:25:40,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:40,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112759212] [2021-11-07 02:25:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:40,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:40,204 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 02:25:40,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:40,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112759212] [2021-11-07 02:25:40,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112759212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:40,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:40,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:25:40,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55539173] [2021-11-07 02:25:40,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:25:40,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:25:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:25:40,206 INFO L87 Difference]: Start difference. First operand 4314 states and 8549 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 02:25:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:41,257 INFO L93 Difference]: Finished difference Result 4575 states and 9071 transitions. [2021-11-07 02:25:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:25:41,258 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 02:25:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:41,263 INFO L225 Difference]: With dead ends: 4575 [2021-11-07 02:25:41,263 INFO L226 Difference]: Without dead ends: 4575 [2021-11-07 02:25:41,263 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 02:25:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2021-11-07 02:25:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4575. [2021-11-07 02:25:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4499 states have (on average 2.0162258279617693) internal successors, (9071), 4574 states have internal predecessors, (9071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 9071 transitions. [2021-11-07 02:25:41,347 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 9071 transitions. Word has length 15 [2021-11-07 02:25:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:41,347 INFO L470 AbstractCegarLoop]: Abstraction has 4575 states and 9071 transitions. [2021-11-07 02:25:41,348 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 02:25:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 9071 transitions. [2021-11-07 02:25:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:41,348 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:41,348 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:41,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 02:25:41,349 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1181436751, now seen corresponding path program 1 times [2021-11-07 02:25:41,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:41,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417615602] [2021-11-07 02:25:41,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:41,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:41,501 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 02:25:41,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:41,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417615602] [2021-11-07 02:25:41,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417615602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:41,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:41,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:41,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570116937] [2021-11-07 02:25:41,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:41,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:41,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:41,503 INFO L87 Difference]: Start difference. First operand 4575 states and 9071 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:43,746 INFO L93 Difference]: Finished difference Result 8995 states and 17784 transitions. [2021-11-07 02:25:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:25:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:43,757 INFO L225 Difference]: With dead ends: 8995 [2021-11-07 02:25:43,757 INFO L226 Difference]: Without dead ends: 8995 [2021-11-07 02:25:43,757 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:25:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8995 states. [2021-11-07 02:25:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8995 to 4719. [2021-11-07 02:25:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4719 states, 4643 states have (on average 2.01572259315098) internal successors, (9359), 4718 states have internal predecessors, (9359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 9359 transitions. [2021-11-07 02:25:43,840 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 9359 transitions. Word has length 17 [2021-11-07 02:25:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:43,840 INFO L470 AbstractCegarLoop]: Abstraction has 4719 states and 9359 transitions. [2021-11-07 02:25:43,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 9359 transitions. [2021-11-07 02:25:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:43,841 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:43,841 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:43,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 02:25:43,841 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1666816694, now seen corresponding path program 1 times [2021-11-07 02:25:43,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:43,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024270708] [2021-11-07 02:25:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:43,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:43,989 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 02:25:43,990 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:43,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024270708] [2021-11-07 02:25:43,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024270708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:43,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:43,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:43,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111174500] [2021-11-07 02:25:43,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:43,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:43,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:43,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:43,991 INFO L87 Difference]: Start difference. First operand 4719 states and 9359 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:45,517 INFO L93 Difference]: Finished difference Result 8927 states and 17648 transitions. [2021-11-07 02:25:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 02:25:45,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:45,530 INFO L225 Difference]: With dead ends: 8927 [2021-11-07 02:25:45,530 INFO L226 Difference]: Without dead ends: 8927 [2021-11-07 02:25:45,530 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:25:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8927 states. [2021-11-07 02:25:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8927 to 4696. [2021-11-07 02:25:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4620 states have (on average 2.0158008658008657) internal successors, (9313), 4695 states have internal predecessors, (9313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 9313 transitions. [2021-11-07 02:25:45,631 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 9313 transitions. Word has length 17 [2021-11-07 02:25:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:45,631 INFO L470 AbstractCegarLoop]: Abstraction has 4696 states and 9313 transitions. [2021-11-07 02:25:45,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 9313 transitions. [2021-11-07 02:25:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:45,632 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:45,632 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:45,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 02:25:45,633 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1555102090, now seen corresponding path program 2 times [2021-11-07 02:25:45,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:45,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740442481] [2021-11-07 02:25:45,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:45,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:45,804 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 02:25:45,804 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:45,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740442481] [2021-11-07 02:25:45,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740442481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:45,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:45,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:45,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13360357] [2021-11-07 02:25:45,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:45,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:45,806 INFO L87 Difference]: Start difference. First operand 4696 states and 9313 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:47,900 INFO L93 Difference]: Finished difference Result 13400 states and 26518 transitions. [2021-11-07 02:25:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:47,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:47,919 INFO L225 Difference]: With dead ends: 13400 [2021-11-07 02:25:47,919 INFO L226 Difference]: Without dead ends: 13400 [2021-11-07 02:25:47,920 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:25:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13400 states. [2021-11-07 02:25:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13400 to 4836. [2021-11-07 02:25:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4836 states, 4760 states have (on average 2.0153361344537815) internal successors, (9593), 4835 states have internal predecessors, (9593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 9593 transitions. [2021-11-07 02:25:48,055 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 9593 transitions. Word has length 17 [2021-11-07 02:25:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:48,056 INFO L470 AbstractCegarLoop]: Abstraction has 4836 states and 9593 transitions. [2021-11-07 02:25:48,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 9593 transitions. [2021-11-07 02:25:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:48,057 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:48,057 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:48,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 02:25:48,057 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash 345849722, now seen corresponding path program 3 times [2021-11-07 02:25:48,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:48,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022943325] [2021-11-07 02:25:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:48,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:48,244 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 02:25:48,244 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:48,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022943325] [2021-11-07 02:25:48,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022943325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:48,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:48,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:48,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250026913] [2021-11-07 02:25:48,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:48,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:48,247 INFO L87 Difference]: Start difference. First operand 4836 states and 9593 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:50,642 INFO L93 Difference]: Finished difference Result 9276 states and 18346 transitions. [2021-11-07 02:25:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:25:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:50,654 INFO L225 Difference]: With dead ends: 9276 [2021-11-07 02:25:50,654 INFO L226 Difference]: Without dead ends: 9276 [2021-11-07 02:25:50,655 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:25:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2021-11-07 02:25:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 4840. [2021-11-07 02:25:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4840 states, 4764 states have (on average 2.0153232577665827) internal successors, (9601), 4839 states have internal predecessors, (9601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 9601 transitions. [2021-11-07 02:25:50,740 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 9601 transitions. Word has length 17 [2021-11-07 02:25:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:50,740 INFO L470 AbstractCegarLoop]: Abstraction has 4840 states and 9601 transitions. [2021-11-07 02:25:50,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 9601 transitions. [2021-11-07 02:25:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:50,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:50,742 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:50,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 02:25:50,742 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash 76861429, now seen corresponding path program 2 times [2021-11-07 02:25:50,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:50,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880970499] [2021-11-07 02:25:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:50,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:50,934 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 02:25:50,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:50,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880970499] [2021-11-07 02:25:50,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880970499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:50,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:50,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:50,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524620590] [2021-11-07 02:25:50,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:50,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:50,937 INFO L87 Difference]: Start difference. First operand 4840 states and 9601 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:53,458 INFO L93 Difference]: Finished difference Result 13295 states and 26308 transitions. [2021-11-07 02:25:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-07 02:25:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:53,480 INFO L225 Difference]: With dead ends: 13295 [2021-11-07 02:25:53,480 INFO L226 Difference]: Without dead ends: 13295 [2021-11-07 02:25:53,481 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 02:25:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13295 states. [2021-11-07 02:25:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13295 to 4707. [2021-11-07 02:25:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4707 states, 4631 states have (on average 2.0157633340531205) internal successors, (9335), 4706 states have internal predecessors, (9335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4707 states to 4707 states and 9335 transitions. [2021-11-07 02:25:53,585 INFO L78 Accepts]: Start accepts. Automaton has 4707 states and 9335 transitions. Word has length 17 [2021-11-07 02:25:53,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:53,585 INFO L470 AbstractCegarLoop]: Abstraction has 4707 states and 9335 transitions. [2021-11-07 02:25:53,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4707 states and 9335 transitions. [2021-11-07 02:25:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:53,586 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:53,586 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:53,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 02:25:53,587 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2033734154, now seen corresponding path program 4 times [2021-11-07 02:25:53,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:53,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040485324] [2021-11-07 02:25:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:53,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:53,762 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 02:25:53,762 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:53,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040485324] [2021-11-07 02:25:53,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040485324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:53,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:53,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:53,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841106464] [2021-11-07 02:25:53,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:53,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:53,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:53,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:53,763 INFO L87 Difference]: Start difference. First operand 4707 states and 9335 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:55,422 INFO L93 Difference]: Finished difference Result 8962 states and 17769 transitions. [2021-11-07 02:25:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:25:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:55,434 INFO L225 Difference]: With dead ends: 8962 [2021-11-07 02:25:55,434 INFO L226 Difference]: Without dead ends: 8962 [2021-11-07 02:25:55,434 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:25:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8962 states. [2021-11-07 02:25:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8962 to 4712. [2021-11-07 02:25:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4636 states have (on average 2.0157463330457293) internal successors, (9345), 4711 states have internal predecessors, (9345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 9345 transitions. [2021-11-07 02:25:55,541 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 9345 transitions. Word has length 17 [2021-11-07 02:25:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:55,541 INFO L470 AbstractCegarLoop]: Abstraction has 4712 states and 9345 transitions. [2021-11-07 02:25:55,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 9345 transitions. [2021-11-07 02:25:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:55,542 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:55,542 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:55,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 02:25:55,542 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:55,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1289375872, now seen corresponding path program 5 times [2021-11-07 02:25:55,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:55,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591521824] [2021-11-07 02:25:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:55,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:55,701 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 02:25:55,701 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:55,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591521824] [2021-11-07 02:25:55,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591521824] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:55,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:55,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:55,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896831597] [2021-11-07 02:25:55,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:55,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:55,703 INFO L87 Difference]: Start difference. First operand 4712 states and 9345 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:57,755 INFO L93 Difference]: Finished difference Result 9037 states and 17919 transitions. [2021-11-07 02:25:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:25:57,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:57,768 INFO L225 Difference]: With dead ends: 9037 [2021-11-07 02:25:57,768 INFO L226 Difference]: Without dead ends: 9037 [2021-11-07 02:25:57,768 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:25:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9037 states. [2021-11-07 02:25:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9037 to 4715. [2021-11-07 02:25:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4715 states, 4639 states have (on average 2.0157361500323345) internal successors, (9351), 4714 states have internal predecessors, (9351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 9351 transitions. [2021-11-07 02:25:57,843 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 9351 transitions. Word has length 17 [2021-11-07 02:25:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:25:57,843 INFO L470 AbstractCegarLoop]: Abstraction has 4715 states and 9351 transitions. [2021-11-07 02:25:57,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 9351 transitions. [2021-11-07 02:25:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:25:57,844 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:25:57,845 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:25:57,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 02:25:57,845 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:25:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:25:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 38034762, now seen corresponding path program 6 times [2021-11-07 02:25:57,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:25:57,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328291889] [2021-11-07 02:25:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:25:57,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:25:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:25:57,988 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 02:25:57,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:25:57,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328291889] [2021-11-07 02:25:57,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328291889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:25:57,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:25:57,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:25:57,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978239972] [2021-11-07 02:25:57,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:25:57,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:25:57,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:25:57,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:25:57,989 INFO L87 Difference]: Start difference. First operand 4715 states and 9351 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:25:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:25:59,923 INFO L93 Difference]: Finished difference Result 4786 states and 9493 transitions. [2021-11-07 02:25:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:25:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:25:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:25:59,928 INFO L225 Difference]: With dead ends: 4786 [2021-11-07 02:25:59,929 INFO L226 Difference]: Without dead ends: 4786 [2021-11-07 02:25:59,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-11-07 02:25:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2021-11-07 02:26:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4622. [2021-11-07 02:26:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4622 states, 4547 states have (on average 2.0156146910050583) internal successors, (9165), 4621 states have internal predecessors, (9165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 9165 transitions. [2021-11-07 02:26:00,009 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 9165 transitions. Word has length 17 [2021-11-07 02:26:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:00,010 INFO L470 AbstractCegarLoop]: Abstraction has 4622 states and 9165 transitions. [2021-11-07 02:26:00,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 9165 transitions. [2021-11-07 02:26:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:26:00,010 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:00,010 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:26:00,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 02:26:00,011 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1283732579, now seen corresponding path program 3 times [2021-11-07 02:26:00,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:00,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892928853] [2021-11-07 02:26:00,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:00,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:00,148 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 02:26:00,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:00,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892928853] [2021-11-07 02:26:00,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892928853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:00,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:00,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:26:00,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158229659] [2021-11-07 02:26:00,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:00,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:00,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:00,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:00,150 INFO L87 Difference]: Start difference. First operand 4622 states and 9165 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:02,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:02,428 INFO L93 Difference]: Finished difference Result 8857 states and 17559 transitions. [2021-11-07 02:26:02,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 02:26:02,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:26:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:02,439 INFO L225 Difference]: With dead ends: 8857 [2021-11-07 02:26:02,440 INFO L226 Difference]: Without dead ends: 8857 [2021-11-07 02:26:02,440 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:26:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8857 states. [2021-11-07 02:26:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8857 to 4437. [2021-11-07 02:26:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4362 states have (on average 2.0162769371847777) internal successors, (8795), 4436 states have internal predecessors, (8795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 8795 transitions. [2021-11-07 02:26:02,516 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 8795 transitions. Word has length 17 [2021-11-07 02:26:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:02,517 INFO L470 AbstractCegarLoop]: Abstraction has 4437 states and 8795 transitions. [2021-11-07 02:26:02,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 8795 transitions. [2021-11-07 02:26:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 02:26:02,517 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:02,518 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] [2021-11-07 02:26:02,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 02:26:02,518 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1085020020, now seen corresponding path program 1 times [2021-11-07 02:26:02,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:02,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885131165] [2021-11-07 02:26:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:02,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:02,603 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 02:26:02,603 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:02,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885131165] [2021-11-07 02:26:02,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885131165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:02,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:02,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:26:02,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047279344] [2021-11-07 02:26:02,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:26:02,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:02,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:26:02,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:26:02,605 INFO L87 Difference]: Start difference. First operand 4437 states and 8795 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:03,528 INFO L93 Difference]: Finished difference Result 4756 states and 9427 transitions. [2021-11-07 02:26:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:26:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-11-07 02:26:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:03,534 INFO L225 Difference]: With dead ends: 4756 [2021-11-07 02:26:03,534 INFO L226 Difference]: Without dead ends: 4756 [2021-11-07 02:26:03,535 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 02:26:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2021-11-07 02:26:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 4640. [2021-11-07 02:26:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4640 states, 4565 states have (on average 2.0146768893756843) internal successors, (9197), 4639 states have internal predecessors, (9197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4640 states to 4640 states and 9197 transitions. [2021-11-07 02:26:03,591 INFO L78 Accepts]: Start accepts. Automaton has 4640 states and 9197 transitions. Word has length 21 [2021-11-07 02:26:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:03,591 INFO L470 AbstractCegarLoop]: Abstraction has 4640 states and 9197 transitions. [2021-11-07 02:26:03,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4640 states and 9197 transitions. [2021-11-07 02:26:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:26:03,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:03,592 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] [2021-11-07 02:26:03,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 02:26:03,593 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1228314538, now seen corresponding path program 1 times [2021-11-07 02:26:03,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:03,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510231645] [2021-11-07 02:26:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:03,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:03,678 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 02:26:03,679 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:03,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510231645] [2021-11-07 02:26:03,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510231645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:03,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:03,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:26:03,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339406825] [2021-11-07 02:26:03,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:26:03,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:03,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:26:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:26:03,680 INFO L87 Difference]: Start difference. First operand 4640 states and 9197 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:04,489 INFO L93 Difference]: Finished difference Result 5039 states and 9995 transitions. [2021-11-07 02:26:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:26:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:26:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:04,494 INFO L225 Difference]: With dead ends: 5039 [2021-11-07 02:26:04,494 INFO L226 Difference]: Without dead ends: 5039 [2021-11-07 02:26:04,495 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 02:26:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2021-11-07 02:26:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 4895. [2021-11-07 02:26:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4895 states, 4821 states have (on average 2.0134826799419208) internal successors, (9707), 4894 states have internal predecessors, (9707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 9707 transitions. [2021-11-07 02:26:04,548 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 9707 transitions. Word has length 22 [2021-11-07 02:26:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:04,548 INFO L470 AbstractCegarLoop]: Abstraction has 4895 states and 9707 transitions. [2021-11-07 02:26:04,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 9707 transitions. [2021-11-07 02:26:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:04,549 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:04,549 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 02:26:04,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 02:26:04,549 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1568217280, now seen corresponding path program 1 times [2021-11-07 02:26:04,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:04,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967132129] [2021-11-07 02:26:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:04,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:04,930 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 02:26:04,930 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:04,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967132129] [2021-11-07 02:26:04,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967132129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:04,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:04,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:26:04,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356896292] [2021-11-07 02:26:04,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:26:04,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:26:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:26:04,931 INFO L87 Difference]: Start difference. First operand 4895 states and 9707 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 02:26:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:06,889 INFO L93 Difference]: Finished difference Result 9818 states and 19417 transitions. [2021-11-07 02:26:06,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:26:06,889 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 02:26:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:06,902 INFO L225 Difference]: With dead ends: 9818 [2021-11-07 02:26:06,902 INFO L226 Difference]: Without dead ends: 9818 [2021-11-07 02:26:06,902 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:26:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9818 states. [2021-11-07 02:26:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9818 to 5051. [2021-11-07 02:26:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 4977 states have (on average 2.0152702431183442) internal successors, (10030), 5050 states have internal predecessors, (10030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 10030 transitions. [2021-11-07 02:26:06,987 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 10030 transitions. Word has length 24 [2021-11-07 02:26:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:06,988 INFO L470 AbstractCegarLoop]: Abstraction has 5051 states and 10030 transitions. [2021-11-07 02:26:06,988 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 02:26:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 10030 transitions. [2021-11-07 02:26:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:06,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:06,989 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 02:26:06,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 02:26:06,990 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash -793298548, now seen corresponding path program 2 times [2021-11-07 02:26:06,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:06,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922235635] [2021-11-07 02:26:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:06,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:07,326 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 02:26:07,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:07,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922235635] [2021-11-07 02:26:07,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922235635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:07,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:07,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:26:07,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173848953] [2021-11-07 02:26:07,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:26:07,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:07,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:26:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:26:07,328 INFO L87 Difference]: Start difference. First operand 5051 states and 10030 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 02:26:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:09,745 INFO L93 Difference]: Finished difference Result 9786 states and 19357 transitions. [2021-11-07 02:26:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:26:09,746 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 02:26:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:09,757 INFO L225 Difference]: With dead ends: 9786 [2021-11-07 02:26:09,757 INFO L226 Difference]: Without dead ends: 9786 [2021-11-07 02:26:09,757 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:26:09,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9786 states. [2021-11-07 02:26:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9786 to 5059. [2021-11-07 02:26:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5059 states, 4985 states have (on average 2.015245737211635) internal successors, (10046), 5058 states have internal predecessors, (10046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 10046 transitions. [2021-11-07 02:26:09,837 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 10046 transitions. Word has length 24 [2021-11-07 02:26:09,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:09,837 INFO L470 AbstractCegarLoop]: Abstraction has 5059 states and 10046 transitions. [2021-11-07 02:26:09,837 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 02:26:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 10046 transitions. [2021-11-07 02:26:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:09,838 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:09,838 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 02:26:09,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-07 02:26:09,839 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1099392576, now seen corresponding path program 3 times [2021-11-07 02:26:09,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:09,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211409433] [2021-11-07 02:26:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:09,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:10,152 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 02:26:10,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:10,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211409433] [2021-11-07 02:26:10,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211409433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:10,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:10,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:26:10,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495302685] [2021-11-07 02:26:10,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:26:10,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:10,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:26:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:26:10,153 INFO L87 Difference]: Start difference. First operand 5059 states and 10046 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 02:26:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:12,872 INFO L93 Difference]: Finished difference Result 9810 states and 19405 transitions. [2021-11-07 02:26:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:26:12,873 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 02:26:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:12,887 INFO L225 Difference]: With dead ends: 9810 [2021-11-07 02:26:12,887 INFO L226 Difference]: Without dead ends: 9810 [2021-11-07 02:26:12,887 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:26:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9810 states. [2021-11-07 02:26:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9810 to 5067. [2021-11-07 02:26:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5067 states, 4993 states have (on average 2.0152213098337675) internal successors, (10062), 5066 states have internal predecessors, (10062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 10062 transitions. [2021-11-07 02:26:12,994 INFO L78 Accepts]: Start accepts. Automaton has 5067 states and 10062 transitions. Word has length 24 [2021-11-07 02:26:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:12,994 INFO L470 AbstractCegarLoop]: Abstraction has 5067 states and 10062 transitions. [2021-11-07 02:26:12,994 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 02:26:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 10062 transitions. [2021-11-07 02:26:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:12,995 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:12,996 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 02:26:12,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-07 02:26:12,996 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1060442636, now seen corresponding path program 4 times [2021-11-07 02:26:12,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:12,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141119136] [2021-11-07 02:26:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:12,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:13,284 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 02:26:13,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:13,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141119136] [2021-11-07 02:26:13,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141119136] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:13,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:13,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:26:13,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616608551] [2021-11-07 02:26:13,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:26:13,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:26:13,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:26:13,287 INFO L87 Difference]: Start difference. First operand 5067 states and 10062 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 02:26:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:15,317 INFO L93 Difference]: Finished difference Result 9834 states and 19453 transitions. [2021-11-07 02:26:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:26:15,317 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 02:26:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:15,331 INFO L225 Difference]: With dead ends: 9834 [2021-11-07 02:26:15,331 INFO L226 Difference]: Without dead ends: 9834 [2021-11-07 02:26:15,331 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:26:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2021-11-07 02:26:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 5075. [2021-11-07 02:26:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 5001 states have (on average 2.0151969606078786) internal successors, (10078), 5074 states have internal predecessors, (10078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 10078 transitions. [2021-11-07 02:26:15,425 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 10078 transitions. Word has length 24 [2021-11-07 02:26:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:15,425 INFO L470 AbstractCegarLoop]: Abstraction has 5075 states and 10078 transitions. [2021-11-07 02:26:15,425 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 02:26:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 10078 transitions. [2021-11-07 02:26:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:15,427 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:15,427 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 02:26:15,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-07 02:26:15,428 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash 747209920, now seen corresponding path program 5 times [2021-11-07 02:26:15,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:15,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796354482] [2021-11-07 02:26:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:15,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:15,603 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 02:26:15,603 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:15,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796354482] [2021-11-07 02:26:15,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796354482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:15,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:15,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:26:15,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949169058] [2021-11-07 02:26:15,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:15,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:15,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:15,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:15,605 INFO L87 Difference]: Start difference. First operand 5075 states and 10078 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:16,960 INFO L93 Difference]: Finished difference Result 8558 states and 16958 transitions. [2021-11-07 02:26:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:26:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:16,968 INFO L225 Difference]: With dead ends: 8558 [2021-11-07 02:26:16,969 INFO L226 Difference]: Without dead ends: 8558 [2021-11-07 02:26:16,969 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:26:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2021-11-07 02:26:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 5118. [2021-11-07 02:26:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5118 states, 5044 states have (on average 2.0160586835844567) internal successors, (10169), 5117 states have internal predecessors, (10169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 10169 transitions. [2021-11-07 02:26:17,043 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 10169 transitions. Word has length 24 [2021-11-07 02:26:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:17,043 INFO L470 AbstractCegarLoop]: Abstraction has 5118 states and 10169 transitions. [2021-11-07 02:26:17,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 10169 transitions. [2021-11-07 02:26:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:17,045 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:17,045 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 02:26:17,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-07 02:26:17,045 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:17,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1433124986, now seen corresponding path program 1 times [2021-11-07 02:26:17,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:17,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469492774] [2021-11-07 02:26:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:17,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:17,176 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 02:26:17,177 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:17,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469492774] [2021-11-07 02:26:17,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469492774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:17,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:17,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:26:17,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364733769] [2021-11-07 02:26:17,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:17,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:17,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:17,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:17,178 INFO L87 Difference]: Start difference. First operand 5118 states and 10169 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:19,099 INFO L93 Difference]: Finished difference Result 8513 states and 16874 transitions. [2021-11-07 02:26:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:26:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:19,109 INFO L225 Difference]: With dead ends: 8513 [2021-11-07 02:26:19,109 INFO L226 Difference]: Without dead ends: 8513 [2021-11-07 02:26:19,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:26:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8513 states. [2021-11-07 02:26:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8513 to 5167. [2021-11-07 02:26:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5167 states, 5093 states have (on average 2.016689573924995) internal successors, (10271), 5166 states have internal predecessors, (10271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 10271 transitions. [2021-11-07 02:26:19,187 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 10271 transitions. Word has length 24 [2021-11-07 02:26:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:19,187 INFO L470 AbstractCegarLoop]: Abstraction has 5167 states and 10271 transitions. [2021-11-07 02:26:19,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 10271 transitions. [2021-11-07 02:26:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:19,189 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:19,189 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 02:26:19,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-07 02:26:19,189 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -700395956, now seen corresponding path program 2 times [2021-11-07 02:26:19,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:19,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795426645] [2021-11-07 02:26:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:19,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:19,362 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 02:26:19,362 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:19,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795426645] [2021-11-07 02:26:19,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795426645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:19,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:19,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:26:19,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382086009] [2021-11-07 02:26:19,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:19,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:19,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:19,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:19,364 INFO L87 Difference]: Start difference. First operand 5167 states and 10271 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:20,783 INFO L93 Difference]: Finished difference Result 5516 states and 10969 transitions. [2021-11-07 02:26:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 02:26:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:20,791 INFO L225 Difference]: With dead ends: 5516 [2021-11-07 02:26:20,791 INFO L226 Difference]: Without dead ends: 5516 [2021-11-07 02:26:20,791 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:26:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2021-11-07 02:26:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 5173. [2021-11-07 02:26:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5099 states have (on average 2.0166699352814277) internal successors, (10283), 5172 states have internal predecessors, (10283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 10283 transitions. [2021-11-07 02:26:20,875 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 10283 transitions. Word has length 24 [2021-11-07 02:26:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:20,875 INFO L470 AbstractCegarLoop]: Abstraction has 5173 states and 10283 transitions. [2021-11-07 02:26:20,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 10283 transitions. [2021-11-07 02:26:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:20,876 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:20,876 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 02:26:20,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-07 02:26:20,880 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:20,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -539812856, now seen corresponding path program 3 times [2021-11-07 02:26:20,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:20,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592957696] [2021-11-07 02:26:20,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:20,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:21,035 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 02:26:21,035 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:21,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592957696] [2021-11-07 02:26:21,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592957696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:21,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:21,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:26:21,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131668455] [2021-11-07 02:26:21,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:21,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:21,036 INFO L87 Difference]: Start difference. First operand 5173 states and 10283 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:22,522 INFO L93 Difference]: Finished difference Result 5596 states and 11129 transitions. [2021-11-07 02:26:22,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:26:22,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:22,529 INFO L225 Difference]: With dead ends: 5596 [2021-11-07 02:26:22,529 INFO L226 Difference]: Without dead ends: 5596 [2021-11-07 02:26:22,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:26:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2021-11-07 02:26:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5178. [2021-11-07 02:26:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5178 states, 5104 states have (on average 2.016653605015674) internal successors, (10293), 5177 states have internal predecessors, (10293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5178 states to 5178 states and 10293 transitions. [2021-11-07 02:26:22,589 INFO L78 Accepts]: Start accepts. Automaton has 5178 states and 10293 transitions. Word has length 24 [2021-11-07 02:26:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:22,590 INFO L470 AbstractCegarLoop]: Abstraction has 5178 states and 10293 transitions. [2021-11-07 02:26:22,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5178 states and 10293 transitions. [2021-11-07 02:26:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:22,591 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:22,591 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 02:26:22,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-07 02:26:22,592 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 171895308, now seen corresponding path program 4 times [2021-11-07 02:26:22,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:22,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412225303] [2021-11-07 02:26:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:22,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:22,732 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 02:26:22,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:22,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412225303] [2021-11-07 02:26:22,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412225303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:22,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:22,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:26:22,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79419973] [2021-11-07 02:26:22,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:22,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:22,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:22,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:22,734 INFO L87 Difference]: Start difference. First operand 5178 states and 10293 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:23,933 INFO L93 Difference]: Finished difference Result 5656 states and 11249 transitions. [2021-11-07 02:26:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:26:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:23,939 INFO L225 Difference]: With dead ends: 5656 [2021-11-07 02:26:23,940 INFO L226 Difference]: Without dead ends: 5656 [2021-11-07 02:26:23,940 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:26:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2021-11-07 02:26:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5183. [2021-11-07 02:26:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 5109 states have (on average 2.0166373067136427) internal successors, (10303), 5182 states have internal predecessors, (10303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 10303 transitions. [2021-11-07 02:26:24,002 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 10303 transitions. Word has length 24 [2021-11-07 02:26:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:24,002 INFO L470 AbstractCegarLoop]: Abstraction has 5183 states and 10303 transitions. [2021-11-07 02:26:24,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 10303 transitions. [2021-11-07 02:26:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:24,004 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:24,004 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 02:26:24,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-07 02:26:24,005 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1471948428, now seen corresponding path program 6 times [2021-11-07 02:26:24,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:24,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169169215] [2021-11-07 02:26:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:24,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:24,189 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 02:26:24,189 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:24,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169169215] [2021-11-07 02:26:24,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169169215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:24,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:24,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:26:24,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795537073] [2021-11-07 02:26:24,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:24,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:24,191 INFO L87 Difference]: Start difference. First operand 5183 states and 10303 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:25,917 INFO L93 Difference]: Finished difference Result 8409 states and 16660 transitions. [2021-11-07 02:26:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:26:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:25,927 INFO L225 Difference]: With dead ends: 8409 [2021-11-07 02:26:25,928 INFO L226 Difference]: Without dead ends: 8409 [2021-11-07 02:26:25,928 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:26:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8409 states. [2021-11-07 02:26:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8409 to 5108. [2021-11-07 02:26:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5108 states, 5035 states have (on average 2.0146971201588877) internal successors, (10144), 5107 states have internal predecessors, (10144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5108 states to 5108 states and 10144 transitions. [2021-11-07 02:26:26,001 INFO L78 Accepts]: Start accepts. Automaton has 5108 states and 10144 transitions. Word has length 24 [2021-11-07 02:26:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:26,001 INFO L470 AbstractCegarLoop]: Abstraction has 5108 states and 10144 transitions. [2021-11-07 02:26:26,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5108 states and 10144 transitions. [2021-11-07 02:26:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:26,003 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:26,003 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 02:26:26,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-07 02:26:26,003 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:26,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash -708386478, now seen corresponding path program 5 times [2021-11-07 02:26:26,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:26,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050098095] [2021-11-07 02:26:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:26,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:26,133 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 02:26:26,133 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:26,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050098095] [2021-11-07 02:26:26,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050098095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:26,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:26,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:26:26,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439014777] [2021-11-07 02:26:26,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:26:26,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:26,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:26:26,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:26:26,135 INFO L87 Difference]: Start difference. First operand 5108 states and 10144 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:28,889 INFO L93 Difference]: Finished difference Result 8524 states and 16900 transitions. [2021-11-07 02:26:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:26:28,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:28,899 INFO L225 Difference]: With dead ends: 8524 [2021-11-07 02:26:28,899 INFO L226 Difference]: Without dead ends: 8524 [2021-11-07 02:26:28,900 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:26:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8524 states. [2021-11-07 02:26:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8524 to 4939. [2021-11-07 02:26:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4867 states have (on average 2.014793507294021) internal successors, (9806), 4938 states have internal predecessors, (9806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 9806 transitions. [2021-11-07 02:26:29,000 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 9806 transitions. Word has length 24 [2021-11-07 02:26:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:29,001 INFO L470 AbstractCegarLoop]: Abstraction has 4939 states and 9806 transitions. [2021-11-07 02:26:29,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 9806 transitions. [2021-11-07 02:26:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:29,002 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:29,002 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 02:26:29,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-07 02:26:29,002 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash -695506987, now seen corresponding path program 1 times [2021-11-07 02:26:29,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:29,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213983556] [2021-11-07 02:26:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:29,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:29,561 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 02:26:29,561 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:29,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213983556] [2021-11-07 02:26:29,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213983556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:29,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:29,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:29,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55723354] [2021-11-07 02:26:29,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:29,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:29,563 INFO L87 Difference]: Start difference. First operand 4939 states and 9806 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:31,987 INFO L93 Difference]: Finished difference Result 5113 states and 10103 transitions. [2021-11-07 02:26:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:26:31,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:31,994 INFO L225 Difference]: With dead ends: 5113 [2021-11-07 02:26:31,994 INFO L226 Difference]: Without dead ends: 5113 [2021-11-07 02:26:31,995 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:26:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2021-11-07 02:26:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 4963. [2021-11-07 02:26:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4963 states, 4891 states have (on average 2.0147209159681045) internal successors, (9854), 4962 states have internal predecessors, (9854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 9854 transitions. [2021-11-07 02:26:32,060 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 9854 transitions. Word has length 24 [2021-11-07 02:26:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:32,061 INFO L470 AbstractCegarLoop]: Abstraction has 4963 states and 9854 transitions. [2021-11-07 02:26:32,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 9854 transitions. [2021-11-07 02:26:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:32,062 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:32,063 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 02:26:32,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-07 02:26:32,063 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:32,064 INFO L85 PathProgramCache]: Analyzing trace with hash -929538469, now seen corresponding path program 2 times [2021-11-07 02:26:32,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:32,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393087797] [2021-11-07 02:26:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:32,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:32,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 02:26:32,578 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:32,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393087797] [2021-11-07 02:26:32,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393087797] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:32,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:32,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:32,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149137021] [2021-11-07 02:26:32,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:32,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:32,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:32,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:32,579 INFO L87 Difference]: Start difference. First operand 4963 states and 9854 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:34,689 INFO L93 Difference]: Finished difference Result 5121 states and 10119 transitions. [2021-11-07 02:26:34,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:26:34,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:34,695 INFO L225 Difference]: With dead ends: 5121 [2021-11-07 02:26:34,695 INFO L226 Difference]: Without dead ends: 5121 [2021-11-07 02:26:34,695 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:26:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2021-11-07 02:26:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 4973. [2021-11-07 02:26:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4973 states, 4901 states have (on average 2.014690879412365) internal successors, (9874), 4972 states have internal predecessors, (9874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 9874 transitions. [2021-11-07 02:26:34,751 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 9874 transitions. Word has length 24 [2021-11-07 02:26:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:34,752 INFO L470 AbstractCegarLoop]: Abstraction has 4973 states and 9874 transitions. [2021-11-07 02:26:34,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 9874 transitions. [2021-11-07 02:26:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:34,753 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:34,753 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 02:26:34,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-07 02:26:34,753 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1243736287, now seen corresponding path program 3 times [2021-11-07 02:26:34,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:34,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096993796] [2021-11-07 02:26:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:34,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:35,199 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 02:26:35,199 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:35,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096993796] [2021-11-07 02:26:35,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096993796] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:35,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:35,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:35,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386642746] [2021-11-07 02:26:35,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:35,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:35,200 INFO L87 Difference]: Start difference. First operand 4973 states and 9874 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:38,396 INFO L93 Difference]: Finished difference Result 5120 states and 10116 transitions. [2021-11-07 02:26:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:26:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:38,401 INFO L225 Difference]: With dead ends: 5120 [2021-11-07 02:26:38,401 INFO L226 Difference]: Without dead ends: 5120 [2021-11-07 02:26:38,401 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2021-11-07 02:26:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2021-11-07 02:26:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 4974. [2021-11-07 02:26:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4974 states, 4902 states have (on average 2.01468788249694) internal successors, (9876), 4973 states have internal predecessors, (9876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 9876 transitions. [2021-11-07 02:26:38,458 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 9876 transitions. Word has length 24 [2021-11-07 02:26:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:38,458 INFO L470 AbstractCegarLoop]: Abstraction has 4974 states and 9876 transitions. [2021-11-07 02:26:38,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 9876 transitions. [2021-11-07 02:26:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:38,459 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:38,459 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 02:26:38,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-07 02:26:38,459 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:38,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1248431857, now seen corresponding path program 4 times [2021-11-07 02:26:38,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:38,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700630210] [2021-11-07 02:26:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:38,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:38,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 02:26:38,932 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:38,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700630210] [2021-11-07 02:26:38,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700630210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:38,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:38,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:38,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976301523] [2021-11-07 02:26:38,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:38,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:38,934 INFO L87 Difference]: Start difference. First operand 4974 states and 9876 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:42,200 INFO L93 Difference]: Finished difference Result 5138 states and 10152 transitions. [2021-11-07 02:26:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 02:26:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:42,205 INFO L225 Difference]: With dead ends: 5138 [2021-11-07 02:26:42,206 INFO L226 Difference]: Without dead ends: 5138 [2021-11-07 02:26:42,206 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=331, Invalid=661, Unknown=0, NotChecked=0, Total=992 [2021-11-07 02:26:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2021-11-07 02:26:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 4982. [2021-11-07 02:26:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 4910 states have (on average 2.0146639511201627) internal successors, (9892), 4981 states have internal predecessors, (9892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 9892 transitions. [2021-11-07 02:26:42,264 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 9892 transitions. Word has length 24 [2021-11-07 02:26:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:42,264 INFO L470 AbstractCegarLoop]: Abstraction has 4982 states and 9892 transitions. [2021-11-07 02:26:42,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 9892 transitions. [2021-11-07 02:26:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:42,265 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:42,265 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 02:26:42,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-07 02:26:42,266 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1780772325, now seen corresponding path program 5 times [2021-11-07 02:26:42,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:42,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681886846] [2021-11-07 02:26:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:42,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:42,817 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 02:26:42,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:42,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681886846] [2021-11-07 02:26:42,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681886846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:42,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:42,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:42,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484042717] [2021-11-07 02:26:42,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:42,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:42,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:42,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:42,818 INFO L87 Difference]: Start difference. First operand 4982 states and 9892 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:45,288 INFO L93 Difference]: Finished difference Result 5155 states and 10188 transitions. [2021-11-07 02:26:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:26:45,289 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:45,297 INFO L225 Difference]: With dead ends: 5155 [2021-11-07 02:26:45,297 INFO L226 Difference]: Without dead ends: 5155 [2021-11-07 02:26:45,298 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:26:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2021-11-07 02:26:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5006. [2021-11-07 02:26:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 4934 states have (on average 2.014592622618565) internal successors, (9940), 5005 states have internal predecessors, (9940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 9940 transitions. [2021-11-07 02:26:45,360 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 9940 transitions. Word has length 24 [2021-11-07 02:26:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:45,360 INFO L470 AbstractCegarLoop]: Abstraction has 5006 states and 9940 transitions. [2021-11-07 02:26:45,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 9940 transitions. [2021-11-07 02:26:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:45,361 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:45,361 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 02:26:45,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-07 02:26:45,361 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 392502431, now seen corresponding path program 6 times [2021-11-07 02:26:45,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:45,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941029734] [2021-11-07 02:26:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:45,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:45,882 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 02:26:45,882 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:45,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941029734] [2021-11-07 02:26:45,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941029734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:45,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:45,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:45,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393040171] [2021-11-07 02:26:45,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:45,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:45,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:45,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:45,883 INFO L87 Difference]: Start difference. First operand 5006 states and 9940 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:49,829 INFO L93 Difference]: Finished difference Result 5162 states and 10200 transitions. [2021-11-07 02:26:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:26:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:49,836 INFO L225 Difference]: With dead ends: 5162 [2021-11-07 02:26:49,836 INFO L226 Difference]: Without dead ends: 5162 [2021-11-07 02:26:49,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=646, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:26:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2021-11-07 02:26:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 5007. [2021-11-07 02:26:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5007 states, 4935 states have (on average 2.0145896656534954) internal successors, (9942), 5006 states have internal predecessors, (9942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5007 states to 5007 states and 9942 transitions. [2021-11-07 02:26:49,894 INFO L78 Accepts]: Start accepts. Automaton has 5007 states and 9942 transitions. Word has length 24 [2021-11-07 02:26:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:49,895 INFO L470 AbstractCegarLoop]: Abstraction has 5007 states and 9942 transitions. [2021-11-07 02:26:49,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5007 states and 9942 transitions. [2021-11-07 02:26:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:49,896 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:49,896 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 02:26:49,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-07 02:26:49,896 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 397198001, now seen corresponding path program 7 times [2021-11-07 02:26:49,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:49,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253430594] [2021-11-07 02:26:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:49,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:50,380 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 02:26:50,380 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:50,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253430594] [2021-11-07 02:26:50,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253430594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:50,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:50,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:50,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816110610] [2021-11-07 02:26:50,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:50,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:50,382 INFO L87 Difference]: Start difference. First operand 5007 states and 9942 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:54,327 INFO L93 Difference]: Finished difference Result 5174 states and 10224 transitions. [2021-11-07 02:26:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:26:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:54,332 INFO L225 Difference]: With dead ends: 5174 [2021-11-07 02:26:54,333 INFO L226 Difference]: Without dead ends: 5174 [2021-11-07 02:26:54,333 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=717, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 02:26:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2021-11-07 02:26:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 4992. [2021-11-07 02:26:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4992 states, 4920 states have (on average 2.0146341463414634) internal successors, (9912), 4991 states have internal predecessors, (9912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4992 states to 4992 states and 9912 transitions. [2021-11-07 02:26:54,389 INFO L78 Accepts]: Start accepts. Automaton has 4992 states and 9912 transitions. Word has length 24 [2021-11-07 02:26:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:54,389 INFO L470 AbstractCegarLoop]: Abstraction has 4992 states and 9912 transitions. [2021-11-07 02:26:54,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4992 states and 9912 transitions. [2021-11-07 02:26:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:54,390 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:54,390 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 02:26:54,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-07 02:26:54,390 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash 232739763, now seen corresponding path program 8 times [2021-11-07 02:26:54,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:54,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646423987] [2021-11-07 02:26:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:54,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:54,817 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 02:26:54,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:54,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646423987] [2021-11-07 02:26:54,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646423987] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:54,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:54,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:54,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797024761] [2021-11-07 02:26:54,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:54,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:54,818 INFO L87 Difference]: Start difference. First operand 4992 states and 9912 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:26:57,289 INFO L93 Difference]: Finished difference Result 5146 states and 10167 transitions. [2021-11-07 02:26:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:26:57,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:26:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:26:57,295 INFO L225 Difference]: With dead ends: 5146 [2021-11-07 02:26:57,295 INFO L226 Difference]: Without dead ends: 5146 [2021-11-07 02:26:57,296 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:26:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2021-11-07 02:26:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 4994. [2021-11-07 02:26:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4994 states, 4922 states have (on average 2.0146281999187323) internal successors, (9916), 4993 states have internal predecessors, (9916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 9916 transitions. [2021-11-07 02:26:57,361 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 9916 transitions. Word has length 24 [2021-11-07 02:26:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:26:57,361 INFO L470 AbstractCegarLoop]: Abstraction has 4994 states and 9916 transitions. [2021-11-07 02:26:57,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:26:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 9916 transitions. [2021-11-07 02:26:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:26:57,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:26:57,362 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 02:26:57,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-07 02:26:57,363 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:26:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:26:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 237435333, now seen corresponding path program 9 times [2021-11-07 02:26:57,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:26:57,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767437225] [2021-11-07 02:26:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:26:57,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:26:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:26:57,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 02:26:57,836 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:26:57,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767437225] [2021-11-07 02:26:57,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767437225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:26:57,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:26:57,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:26:57,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240315080] [2021-11-07 02:26:57,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:26:57,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:26:57,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:26:57,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:26:57,838 INFO L87 Difference]: Start difference. First operand 4994 states and 9916 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:01,374 INFO L93 Difference]: Finished difference Result 5185 states and 10245 transitions. [2021-11-07 02:27:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-07 02:27:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:01,380 INFO L225 Difference]: With dead ends: 5185 [2021-11-07 02:27:01,380 INFO L226 Difference]: Without dead ends: 5185 [2021-11-07 02:27:01,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 02:27:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2021-11-07 02:27:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 4993. [2021-11-07 02:27:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4921 states have (on average 2.014631172525909) internal successors, (9914), 4992 states have internal predecessors, (9914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 9914 transitions. [2021-11-07 02:27:01,442 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 9914 transitions. Word has length 24 [2021-11-07 02:27:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:01,442 INFO L470 AbstractCegarLoop]: Abstraction has 4993 states and 9914 transitions. [2021-11-07 02:27:01,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 9914 transitions. [2021-11-07 02:27:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:01,443 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:01,443 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 02:27:01,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-07 02:27:01,443 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash 383920563, now seen corresponding path program 10 times [2021-11-07 02:27:01,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:01,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3234889] [2021-11-07 02:27:01,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:01,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:01,812 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 02:27:01,812 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:01,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3234889] [2021-11-07 02:27:01,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3234889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:01,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:01,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:01,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180550497] [2021-11-07 02:27:01,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:01,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:01,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:01,814 INFO L87 Difference]: Start difference. First operand 4993 states and 9914 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:04,308 INFO L93 Difference]: Finished difference Result 5201 states and 10277 transitions. [2021-11-07 02:27:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 02:27:04,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:04,314 INFO L225 Difference]: With dead ends: 5201 [2021-11-07 02:27:04,315 INFO L226 Difference]: Without dead ends: 5201 [2021-11-07 02:27:04,315 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=464, Invalid=942, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 02:27:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2021-11-07 02:27:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 5001. [2021-11-07 02:27:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5001 states, 4929 states have (on average 2.014607425441266) internal successors, (9930), 5000 states have internal predecessors, (9930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 9930 transitions. [2021-11-07 02:27:04,377 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 9930 transitions. Word has length 24 [2021-11-07 02:27:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:04,377 INFO L470 AbstractCegarLoop]: Abstraction has 5001 states and 9930 transitions. [2021-11-07 02:27:04,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 9930 transitions. [2021-11-07 02:27:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:04,378 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:04,378 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 02:27:04,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-07 02:27:04,379 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 739344599, now seen corresponding path program 11 times [2021-11-07 02:27:04,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:04,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703405155] [2021-11-07 02:27:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:04,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:04,815 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 02:27:04,815 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:04,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703405155] [2021-11-07 02:27:04,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703405155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:04,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:04,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:04,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760397140] [2021-11-07 02:27:04,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:04,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:04,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:04,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:04,816 INFO L87 Difference]: Start difference. First operand 5001 states and 9930 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:06,795 INFO L93 Difference]: Finished difference Result 5196 states and 10270 transitions. [2021-11-07 02:27:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:27:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:06,802 INFO L225 Difference]: With dead ends: 5196 [2021-11-07 02:27:06,802 INFO L226 Difference]: Without dead ends: 5196 [2021-11-07 02:27:06,802 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:27:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2021-11-07 02:27:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 5037. [2021-11-07 02:27:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 4965 states have (on average 2.0145015105740183) internal successors, (10002), 5036 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 10002 transitions. [2021-11-07 02:27:06,886 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 10002 transitions. Word has length 24 [2021-11-07 02:27:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:06,887 INFO L470 AbstractCegarLoop]: Abstraction has 5037 states and 10002 transitions. [2021-11-07 02:27:06,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 10002 transitions. [2021-11-07 02:27:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:06,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:06,888 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 02:27:06,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-07 02:27:06,888 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1382347941, now seen corresponding path program 12 times [2021-11-07 02:27:06,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:06,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243033287] [2021-11-07 02:27:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:06,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:07,458 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 02:27:07,458 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:07,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243033287] [2021-11-07 02:27:07,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243033287] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:07,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:07,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:07,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516834101] [2021-11-07 02:27:07,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:07,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:07,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:07,460 INFO L87 Difference]: Start difference. First operand 5037 states and 10002 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:10,332 INFO L93 Difference]: Finished difference Result 5207 states and 10292 transitions. [2021-11-07 02:27:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:27:10,333 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:10,338 INFO L225 Difference]: With dead ends: 5207 [2021-11-07 02:27:10,338 INFO L226 Difference]: Without dead ends: 5207 [2021-11-07 02:27:10,338 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:27:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2021-11-07 02:27:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 5038. [2021-11-07 02:27:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5038 states, 4966 states have (on average 2.0144985904148207) internal successors, (10004), 5037 states have internal predecessors, (10004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5038 states to 5038 states and 10004 transitions. [2021-11-07 02:27:10,396 INFO L78 Accepts]: Start accepts. Automaton has 5038 states and 10004 transitions. Word has length 24 [2021-11-07 02:27:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:10,396 INFO L470 AbstractCegarLoop]: Abstraction has 5038 states and 10004 transitions. [2021-11-07 02:27:10,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5038 states and 10004 transitions. [2021-11-07 02:27:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:10,397 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:10,397 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 02:27:10,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-07 02:27:10,398 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1377652371, now seen corresponding path program 13 times [2021-11-07 02:27:10,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:10,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671300060] [2021-11-07 02:27:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:10,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:10,931 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 02:27:10,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:10,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671300060] [2021-11-07 02:27:10,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671300060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:10,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:10,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:10,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82169889] [2021-11-07 02:27:10,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:10,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:10,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:10,933 INFO L87 Difference]: Start difference. First operand 5038 states and 10004 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:13,104 INFO L93 Difference]: Finished difference Result 5216 states and 10310 transitions. [2021-11-07 02:27:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:27:13,105 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:13,110 INFO L225 Difference]: With dead ends: 5216 [2021-11-07 02:27:13,110 INFO L226 Difference]: Without dead ends: 5216 [2021-11-07 02:27:13,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:27:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2021-11-07 02:27:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5025. [2021-11-07 02:27:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5025 states, 4953 states have (on average 2.0145366444579045) internal successors, (9978), 5024 states have internal predecessors, (9978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 9978 transitions. [2021-11-07 02:27:13,169 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 9978 transitions. Word has length 24 [2021-11-07 02:27:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:13,169 INFO L470 AbstractCegarLoop]: Abstraction has 5025 states and 9978 transitions. [2021-11-07 02:27:13,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 9978 transitions. [2021-11-07 02:27:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:13,170 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:13,170 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 02:27:13,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-07 02:27:13,170 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1542110609, now seen corresponding path program 14 times [2021-11-07 02:27:13,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:13,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137296715] [2021-11-07 02:27:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:13,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:13,561 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 02:27:13,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:13,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137296715] [2021-11-07 02:27:13,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137296715] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:13,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:13,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:13,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027744518] [2021-11-07 02:27:13,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:13,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:13,564 INFO L87 Difference]: Start difference. First operand 5025 states and 9978 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:15,977 INFO L93 Difference]: Finished difference Result 5202 states and 10279 transitions. [2021-11-07 02:27:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:27:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:15,983 INFO L225 Difference]: With dead ends: 5202 [2021-11-07 02:27:15,983 INFO L226 Difference]: Without dead ends: 5202 [2021-11-07 02:27:15,983 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:27:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2021-11-07 02:27:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5027. [2021-11-07 02:27:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5027 states, 4955 states have (on average 2.0145307769929364) internal successors, (9982), 5026 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 9982 transitions. [2021-11-07 02:27:16,081 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 9982 transitions. Word has length 24 [2021-11-07 02:27:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:16,081 INFO L470 AbstractCegarLoop]: Abstraction has 5027 states and 9982 transitions. [2021-11-07 02:27:16,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 9982 transitions. [2021-11-07 02:27:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:16,082 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:16,082 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 02:27:16,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-07 02:27:16,082 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1537415039, now seen corresponding path program 15 times [2021-11-07 02:27:16,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:16,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948713007] [2021-11-07 02:27:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:16,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:16,575 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 02:27:16,576 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:16,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948713007] [2021-11-07 02:27:16,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948713007] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:16,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:16,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:16,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594113955] [2021-11-07 02:27:16,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:16,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:16,577 INFO L87 Difference]: Start difference. First operand 5027 states and 9982 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:21,081 INFO L93 Difference]: Finished difference Result 5229 states and 10333 transitions. [2021-11-07 02:27:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 02:27:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:21,088 INFO L225 Difference]: With dead ends: 5229 [2021-11-07 02:27:21,088 INFO L226 Difference]: Without dead ends: 5229 [2021-11-07 02:27:21,088 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=413, Invalid=919, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 02:27:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5229 states. [2021-11-07 02:27:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5229 to 5026. [2021-11-07 02:27:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 4954 states have (on average 2.0145337101332257) internal successors, (9980), 5025 states have internal predecessors, (9980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 9980 transitions. [2021-11-07 02:27:21,150 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 9980 transitions. Word has length 24 [2021-11-07 02:27:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:21,150 INFO L470 AbstractCegarLoop]: Abstraction has 5026 states and 9980 transitions. [2021-11-07 02:27:21,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 9980 transitions. [2021-11-07 02:27:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:21,151 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:21,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 02:27:21,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-07 02:27:21,152 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1390929809, now seen corresponding path program 16 times [2021-11-07 02:27:21,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:21,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121510330] [2021-11-07 02:27:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:21,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:21,594 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 02:27:21,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:21,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121510330] [2021-11-07 02:27:21,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121510330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:21,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:21,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:21,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318323050] [2021-11-07 02:27:21,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:21,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:21,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:21,596 INFO L87 Difference]: Start difference. First operand 5026 states and 9980 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:24,862 INFO L93 Difference]: Finished difference Result 5227 states and 10329 transitions. [2021-11-07 02:27:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-07 02:27:24,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:24,869 INFO L225 Difference]: With dead ends: 5227 [2021-11-07 02:27:24,869 INFO L226 Difference]: Without dead ends: 5227 [2021-11-07 02:27:24,869 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1011, Unknown=0, NotChecked=0, Total=1482 [2021-11-07 02:27:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2021-11-07 02:27:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 5011. [2021-11-07 02:27:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5011 states, 4939 states have (on average 2.0145778497671594) internal successors, (9950), 5010 states have internal predecessors, (9950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5011 states to 5011 states and 9950 transitions. [2021-11-07 02:27:24,932 INFO L78 Accepts]: Start accepts. Automaton has 5011 states and 9950 transitions. Word has length 24 [2021-11-07 02:27:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:24,932 INFO L470 AbstractCegarLoop]: Abstraction has 5011 states and 9950 transitions. [2021-11-07 02:27:24,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5011 states and 9950 transitions. [2021-11-07 02:27:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:24,933 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:24,933 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 02:27:24,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-07 02:27:24,933 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1916482431, now seen corresponding path program 17 times [2021-11-07 02:27:24,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:24,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899292281] [2021-11-07 02:27:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:24,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:25,369 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 02:27:25,370 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:25,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899292281] [2021-11-07 02:27:25,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899292281] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:25,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:25,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:25,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394390928] [2021-11-07 02:27:25,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:25,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:25,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:25,371 INFO L87 Difference]: Start difference. First operand 5011 states and 9950 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:27,273 INFO L93 Difference]: Finished difference Result 5178 states and 10230 transitions. [2021-11-07 02:27:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:27:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:27,280 INFO L225 Difference]: With dead ends: 5178 [2021-11-07 02:27:27,280 INFO L226 Difference]: Without dead ends: 5178 [2021-11-07 02:27:27,280 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=551, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:27:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2021-11-07 02:27:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 5014. [2021-11-07 02:27:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5014 states, 4942 states have (on average 2.0145690004046943) internal successors, (9956), 5013 states have internal predecessors, (9956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 9956 transitions. [2021-11-07 02:27:27,342 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 9956 transitions. Word has length 24 [2021-11-07 02:27:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:27,343 INFO L470 AbstractCegarLoop]: Abstraction has 5014 states and 9956 transitions. [2021-11-07 02:27:27,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 9956 transitions. [2021-11-07 02:27:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:27,344 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:27,344 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 02:27:27,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-07 02:27:27,344 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1911786861, now seen corresponding path program 18 times [2021-11-07 02:27:27,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:27,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190115976] [2021-11-07 02:27:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:27,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:27,779 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 02:27:27,779 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:27,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190115976] [2021-11-07 02:27:27,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190115976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:27,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:27,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:27,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281447292] [2021-11-07 02:27:27,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:27,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:27,781 INFO L87 Difference]: Start difference. First operand 5014 states and 9956 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:29,764 INFO L93 Difference]: Finished difference Result 5216 states and 10306 transitions. [2021-11-07 02:27:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:27:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:29,778 INFO L225 Difference]: With dead ends: 5216 [2021-11-07 02:27:29,778 INFO L226 Difference]: Without dead ends: 5216 [2021-11-07 02:27:29,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=622, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:27:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2021-11-07 02:27:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5013. [2021-11-07 02:27:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5013 states, 4941 states have (on average 2.0145719489981784) internal successors, (9954), 5012 states have internal predecessors, (9954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 9954 transitions. [2021-11-07 02:27:29,844 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 9954 transitions. Word has length 24 [2021-11-07 02:27:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:29,844 INFO L470 AbstractCegarLoop]: Abstraction has 5013 states and 9954 transitions. [2021-11-07 02:27:29,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 9954 transitions. [2021-11-07 02:27:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:29,845 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:29,845 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 02:27:29,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-07 02:27:29,846 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1765301631, now seen corresponding path program 19 times [2021-11-07 02:27:29,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:29,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495057629] [2021-11-07 02:27:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:29,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:30,236 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 02:27:30,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:30,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495057629] [2021-11-07 02:27:30,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495057629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:30,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:30,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:30,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626764973] [2021-11-07 02:27:30,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:30,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:30,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:30,238 INFO L87 Difference]: Start difference. First operand 5013 states and 9954 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:34,768 INFO L93 Difference]: Finished difference Result 5250 states and 10374 transitions. [2021-11-07 02:27:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-07 02:27:34,768 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:34,774 INFO L225 Difference]: With dead ends: 5250 [2021-11-07 02:27:34,774 INFO L226 Difference]: Without dead ends: 5250 [2021-11-07 02:27:34,775 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=547, Invalid=1175, Unknown=0, NotChecked=0, Total=1722 [2021-11-07 02:27:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2021-11-07 02:27:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5012. [2021-11-07 02:27:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 4940 states have (on average 2.0145748987854253) internal successors, (9952), 5011 states have internal predecessors, (9952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 9952 transitions. [2021-11-07 02:27:34,840 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 9952 transitions. Word has length 24 [2021-11-07 02:27:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:34,840 INFO L470 AbstractCegarLoop]: Abstraction has 5012 states and 9952 transitions. [2021-11-07 02:27:34,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 9952 transitions. [2021-11-07 02:27:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:34,841 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:34,841 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 02:27:34,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-07 02:27:34,841 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1433428717, now seen corresponding path program 20 times [2021-11-07 02:27:34,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:34,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222687593] [2021-11-07 02:27:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:34,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:35,239 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 02:27:35,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:35,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222687593] [2021-11-07 02:27:35,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222687593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:35,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:35,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:35,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879819244] [2021-11-07 02:27:35,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:35,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:35,241 INFO L87 Difference]: Start difference. First operand 5012 states and 9952 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:39,805 INFO L93 Difference]: Finished difference Result 5264 states and 10402 transitions. [2021-11-07 02:27:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 02:27:39,806 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:39,811 INFO L225 Difference]: With dead ends: 5264 [2021-11-07 02:27:39,812 INFO L226 Difference]: Without dead ends: 5264 [2021-11-07 02:27:39,812 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=581, Invalid=1311, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 02:27:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2021-11-07 02:27:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 5020. [2021-11-07 02:27:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5020 states, 4948 states have (on average 2.0145513338722716) internal successors, (9968), 5019 states have internal predecessors, (9968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 9968 transitions. [2021-11-07 02:27:39,876 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 9968 transitions. Word has length 24 [2021-11-07 02:27:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:39,876 INFO L470 AbstractCegarLoop]: Abstraction has 5020 states and 9968 transitions. [2021-11-07 02:27:39,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 9968 transitions. [2021-11-07 02:27:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:39,877 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:39,877 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 02:27:39,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-07 02:27:39,878 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2083982941, now seen corresponding path program 21 times [2021-11-07 02:27:39,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:39,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303351193] [2021-11-07 02:27:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:39,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:40,323 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 02:27:40,323 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:40,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303351193] [2021-11-07 02:27:40,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303351193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:40,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:40,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:40,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224602836] [2021-11-07 02:27:40,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:40,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:40,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:40,325 INFO L87 Difference]: Start difference. First operand 5020 states and 9968 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:43,213 INFO L93 Difference]: Finished difference Result 9595 states and 18981 transitions. [2021-11-07 02:27:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:27:43,214 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:43,225 INFO L225 Difference]: With dead ends: 9595 [2021-11-07 02:27:43,225 INFO L226 Difference]: Without dead ends: 9595 [2021-11-07 02:27:43,226 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:27:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9595 states. [2021-11-07 02:27:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9595 to 5041. [2021-11-07 02:27:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5041 states, 4969 states have (on average 2.014489836989334) internal successors, (10010), 5040 states have internal predecessors, (10010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5041 states to 5041 states and 10010 transitions. [2021-11-07 02:27:43,314 INFO L78 Accepts]: Start accepts. Automaton has 5041 states and 10010 transitions. Word has length 24 [2021-11-07 02:27:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:43,314 INFO L470 AbstractCegarLoop]: Abstraction has 5041 states and 10010 transitions. [2021-11-07 02:27:43,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5041 states and 10010 transitions. [2021-11-07 02:27:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:43,315 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:43,315 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 02:27:43,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-07 02:27:43,316 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1875699781, now seen corresponding path program 22 times [2021-11-07 02:27:43,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:43,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544582574] [2021-11-07 02:27:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:43,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:43,718 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 02:27:43,718 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:43,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544582574] [2021-11-07 02:27:43,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544582574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:43,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:43,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:43,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591295900] [2021-11-07 02:27:43,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:43,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:43,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:43,719 INFO L87 Difference]: Start difference. First operand 5041 states and 10010 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:46,798 INFO L93 Difference]: Finished difference Result 9599 states and 18989 transitions. [2021-11-07 02:27:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:27:46,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:46,817 INFO L225 Difference]: With dead ends: 9599 [2021-11-07 02:27:46,817 INFO L226 Difference]: Without dead ends: 9599 [2021-11-07 02:27:46,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=573, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:27:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9599 states. [2021-11-07 02:27:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9599 to 5042. [2021-11-07 02:27:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5042 states, 4970 states have (on average 2.014486921529175) internal successors, (10012), 5041 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 10012 transitions. [2021-11-07 02:27:46,906 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 10012 transitions. Word has length 24 [2021-11-07 02:27:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:46,906 INFO L470 AbstractCegarLoop]: Abstraction has 5042 states and 10012 transitions. [2021-11-07 02:27:46,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 10012 transitions. [2021-11-07 02:27:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:46,907 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:46,907 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 02:27:46,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-07 02:27:46,907 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1871004211, now seen corresponding path program 23 times [2021-11-07 02:27:46,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:46,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257162617] [2021-11-07 02:27:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:46,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:47,276 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 02:27:47,276 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:47,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257162617] [2021-11-07 02:27:47,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257162617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:47,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:47,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:47,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215495662] [2021-11-07 02:27:47,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:47,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:47,277 INFO L87 Difference]: Start difference. First operand 5042 states and 10012 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:49,927 INFO L93 Difference]: Finished difference Result 9618 states and 19027 transitions. [2021-11-07 02:27:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:27:49,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:49,939 INFO L225 Difference]: With dead ends: 9618 [2021-11-07 02:27:49,939 INFO L226 Difference]: Without dead ends: 9618 [2021-11-07 02:27:49,940 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2021-11-07 02:27:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2021-11-07 02:27:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 5029. [2021-11-07 02:27:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5029 states, 4957 states have (on average 2.0145249142626587) internal successors, (9986), 5028 states have internal predecessors, (9986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 9986 transitions. [2021-11-07 02:27:50,023 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 9986 transitions. Word has length 24 [2021-11-07 02:27:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:50,023 INFO L470 AbstractCegarLoop]: Abstraction has 5029 states and 9986 transitions. [2021-11-07 02:27:50,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 9986 transitions. [2021-11-07 02:27:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:50,024 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:50,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 02:27:50,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-07 02:27:50,024 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1522267101, now seen corresponding path program 24 times [2021-11-07 02:27:50,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:50,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169413738] [2021-11-07 02:27:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:50,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:50,319 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 02:27:50,320 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:50,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169413738] [2021-11-07 02:27:50,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169413738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:50,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:50,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:50,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014996933] [2021-11-07 02:27:50,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:50,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:50,321 INFO L87 Difference]: Start difference. First operand 5029 states and 9986 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:52,809 INFO L93 Difference]: Finished difference Result 9605 states and 19001 transitions. [2021-11-07 02:27:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:27:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:52,821 INFO L225 Difference]: With dead ends: 9605 [2021-11-07 02:27:52,822 INFO L226 Difference]: Without dead ends: 9605 [2021-11-07 02:27:52,822 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:27:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2021-11-07 02:27:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 5031. [2021-11-07 02:27:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5031 states, 4959 states have (on average 2.014519056261343) internal successors, (9990), 5030 states have internal predecessors, (9990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 9990 transitions. [2021-11-07 02:27:52,910 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 9990 transitions. Word has length 24 [2021-11-07 02:27:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:52,911 INFO L470 AbstractCegarLoop]: Abstraction has 5031 states and 9990 transitions. [2021-11-07 02:27:52,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 9990 transitions. [2021-11-07 02:27:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:52,912 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:52,912 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 02:27:52,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-07 02:27:52,912 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1517571531, now seen corresponding path program 25 times [2021-11-07 02:27:52,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:52,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862624591] [2021-11-07 02:27:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:52,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:53,240 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 02:27:53,240 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:53,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862624591] [2021-11-07 02:27:53,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862624591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:53,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:53,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:53,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668636906] [2021-11-07 02:27:53,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:53,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:53,241 INFO L87 Difference]: Start difference. First operand 5031 states and 9990 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:56,305 INFO L93 Difference]: Finished difference Result 9624 states and 19039 transitions. [2021-11-07 02:27:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:27:56,306 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:56,319 INFO L225 Difference]: With dead ends: 9624 [2021-11-07 02:27:56,319 INFO L226 Difference]: Without dead ends: 9624 [2021-11-07 02:27:56,319 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:27:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9624 states. [2021-11-07 02:27:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9624 to 5030. [2021-11-07 02:27:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5030 states, 4958 states have (on average 2.0145219846712386) internal successors, (9988), 5029 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 9988 transitions. [2021-11-07 02:27:56,456 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 9988 transitions. Word has length 24 [2021-11-07 02:27:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:56,456 INFO L470 AbstractCegarLoop]: Abstraction has 5030 states and 9988 transitions. [2021-11-07 02:27:56,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 9988 transitions. [2021-11-07 02:27:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:56,457 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:56,457 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 02:27:56,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-07 02:27:56,457 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1371086301, now seen corresponding path program 26 times [2021-11-07 02:27:56,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:56,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171980268] [2021-11-07 02:27:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:56,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:56,754 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 02:27:56,754 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:56,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171980268] [2021-11-07 02:27:56,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171980268] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:56,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:56,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:56,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367009008] [2021-11-07 02:27:56,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:56,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:56,756 INFO L87 Difference]: Start difference. First operand 5030 states and 9988 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:27:59,036 INFO L93 Difference]: Finished difference Result 9641 states and 19073 transitions. [2021-11-07 02:27:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 02:27:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:27:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:27:59,050 INFO L225 Difference]: With dead ends: 9641 [2021-11-07 02:27:59,050 INFO L226 Difference]: Without dead ends: 9641 [2021-11-07 02:27:59,050 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2021-11-07 02:27:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9641 states. [2021-11-07 02:27:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9641 to 5017. [2021-11-07 02:27:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 4945 states have (on average 2.0145601617795754) internal successors, (9962), 5016 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 9962 transitions. [2021-11-07 02:27:59,137 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 9962 transitions. Word has length 24 [2021-11-07 02:27:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:27:59,137 INFO L470 AbstractCegarLoop]: Abstraction has 5017 states and 9962 transitions. [2021-11-07 02:27:59,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:27:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 9962 transitions. [2021-11-07 02:27:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:27:59,139 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:27:59,139 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 02:27:59,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-07 02:27:59,139 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:27:59,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:27:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash 619068731, now seen corresponding path program 27 times [2021-11-07 02:27:59,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:27:59,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351937383] [2021-11-07 02:27:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:27:59,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:27:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:27:59,420 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 02:27:59,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:27:59,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351937383] [2021-11-07 02:27:59,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351937383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:27:59,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:27:59,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:27:59,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254334002] [2021-11-07 02:27:59,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:27:59,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:27:59,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:27:59,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:27:59,422 INFO L87 Difference]: Start difference. First operand 5017 states and 9962 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:01,874 INFO L93 Difference]: Finished difference Result 9630 states and 19047 transitions. [2021-11-07 02:28:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 02:28:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:01,895 INFO L225 Difference]: With dead ends: 9630 [2021-11-07 02:28:01,895 INFO L226 Difference]: Without dead ends: 9630 [2021-11-07 02:28:01,895 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2021-11-07 02:28:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9630 states. [2021-11-07 02:28:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9630 to 5020. [2021-11-07 02:28:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5020 states, 4948 states have (on average 2.0145513338722716) internal successors, (9968), 5019 states have internal predecessors, (9968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 9968 transitions. [2021-11-07 02:28:01,994 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 9968 transitions. Word has length 24 [2021-11-07 02:28:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:01,994 INFO L470 AbstractCegarLoop]: Abstraction has 5020 states and 9968 transitions. [2021-11-07 02:28:01,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 9968 transitions. [2021-11-07 02:28:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:01,995 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:01,995 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 02:28:01,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-07 02:28:01,996 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 623764301, now seen corresponding path program 28 times [2021-11-07 02:28:01,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:01,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001101357] [2021-11-07 02:28:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:01,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:02,261 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 02:28:02,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:02,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001101357] [2021-11-07 02:28:02,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001101357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:02,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:02,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:02,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185549314] [2021-11-07 02:28:02,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:02,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:02,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:02,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:02,263 INFO L87 Difference]: Start difference. First operand 5020 states and 9968 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:05,046 INFO L93 Difference]: Finished difference Result 9665 states and 19117 transitions. [2021-11-07 02:28:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 02:28:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:05,058 INFO L225 Difference]: With dead ends: 9665 [2021-11-07 02:28:05,058 INFO L226 Difference]: Without dead ends: 9665 [2021-11-07 02:28:05,058 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=342, Invalid=780, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 02:28:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9665 states. [2021-11-07 02:28:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9665 to 5019. [2021-11-07 02:28:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5019 states, 4947 states have (on average 2.0145542753183747) internal successors, (9966), 5018 states have internal predecessors, (9966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 9966 transitions. [2021-11-07 02:28:05,156 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 9966 transitions. Word has length 24 [2021-11-07 02:28:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:05,156 INFO L470 AbstractCegarLoop]: Abstraction has 5019 states and 9966 transitions. [2021-11-07 02:28:05,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 9966 transitions. [2021-11-07 02:28:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:05,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:05,157 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 02:28:05,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-07 02:28:05,157 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash 770249531, now seen corresponding path program 29 times [2021-11-07 02:28:05,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:05,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461948174] [2021-11-07 02:28:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:05,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:05,404 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 02:28:05,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:05,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461948174] [2021-11-07 02:28:05,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461948174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:05,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:05,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:05,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791646949] [2021-11-07 02:28:05,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:05,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:05,405 INFO L87 Difference]: Start difference. First operand 5019 states and 9966 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:09,075 INFO L93 Difference]: Finished difference Result 9688 states and 19163 transitions. [2021-11-07 02:28:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-07 02:28:09,075 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:09,086 INFO L225 Difference]: With dead ends: 9688 [2021-11-07 02:28:09,086 INFO L226 Difference]: Without dead ends: 9688 [2021-11-07 02:28:09,086 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=649, Invalid=1607, Unknown=0, NotChecked=0, Total=2256 [2021-11-07 02:28:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2021-11-07 02:28:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 5018. [2021-11-07 02:28:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5018 states, 4946 states have (on average 2.014557217953902) internal successors, (9964), 5017 states have internal predecessors, (9964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 9964 transitions. [2021-11-07 02:28:09,183 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 9964 transitions. Word has length 24 [2021-11-07 02:28:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:09,183 INFO L470 AbstractCegarLoop]: Abstraction has 5018 states and 9964 transitions. [2021-11-07 02:28:09,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 9964 transitions. [2021-11-07 02:28:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:09,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:09,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 02:28:09,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-07 02:28:09,184 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1102122445, now seen corresponding path program 30 times [2021-11-07 02:28:09,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:09,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918662260] [2021-11-07 02:28:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:09,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:09,392 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 02:28:09,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:09,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918662260] [2021-11-07 02:28:09,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918662260] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:09,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:09,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:09,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026757731] [2021-11-07 02:28:09,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:09,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:09,394 INFO L87 Difference]: Start difference. First operand 5018 states and 9964 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:13,053 INFO L93 Difference]: Finished difference Result 9633 states and 19053 transitions. [2021-11-07 02:28:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-07 02:28:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:13,093 INFO L225 Difference]: With dead ends: 9633 [2021-11-07 02:28:13,093 INFO L226 Difference]: Without dead ends: 9633 [2021-11-07 02:28:13,094 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=685, Invalid=1765, Unknown=0, NotChecked=0, Total=2450 [2021-11-07 02:28:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9633 states. [2021-11-07 02:28:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9633 to 5005. [2021-11-07 02:28:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5005 states, 4933 states have (on average 2.014595580782485) internal successors, (9938), 5004 states have internal predecessors, (9938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 9938 transitions. [2021-11-07 02:28:13,159 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 9938 transitions. Word has length 24 [2021-11-07 02:28:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:13,159 INFO L470 AbstractCegarLoop]: Abstraction has 5005 states and 9938 transitions. [2021-11-07 02:28:13,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 9938 transitions. [2021-11-07 02:28:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:13,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:13,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 02:28:13,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-07 02:28:13,160 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1925307991, now seen corresponding path program 1 times [2021-11-07 02:28:13,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:13,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342430439] [2021-11-07 02:28:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:13,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:13,326 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 02:28:13,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:13,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342430439] [2021-11-07 02:28:13,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342430439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:13,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:13,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:28:13,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64146032] [2021-11-07 02:28:13,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:28:13,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:13,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:28:13,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:28:13,327 INFO L87 Difference]: Start difference. First operand 5005 states and 9938 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 02:28:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:14,778 INFO L93 Difference]: Finished difference Result 8790 states and 17446 transitions. [2021-11-07 02:28:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:28:14,778 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 02:28:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:14,787 INFO L225 Difference]: With dead ends: 8790 [2021-11-07 02:28:14,787 INFO L226 Difference]: Without dead ends: 8790 [2021-11-07 02:28:14,788 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:28:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2021-11-07 02:28:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 5084. [2021-11-07 02:28:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5084 states, 5012 states have (on average 2.0151636073423784) internal successors, (10100), 5083 states have internal predecessors, (10100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 10100 transitions. [2021-11-07 02:28:14,858 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 10100 transitions. Word has length 24 [2021-11-07 02:28:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:14,858 INFO L470 AbstractCegarLoop]: Abstraction has 5084 states and 10100 transitions. [2021-11-07 02:28:14,858 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 02:28:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 10100 transitions. [2021-11-07 02:28:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:14,859 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:14,859 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 02:28:14,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-07 02:28:14,860 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2095490125, now seen corresponding path program 31 times [2021-11-07 02:28:14,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:14,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464829096] [2021-11-07 02:28:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:14,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:15,006 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 02:28:15,007 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:15,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464829096] [2021-11-07 02:28:15,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464829096] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:15,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:15,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:28:15,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282558692] [2021-11-07 02:28:15,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:28:15,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:28:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:28:15,008 INFO L87 Difference]: Start difference. First operand 5084 states and 10100 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 02:28:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:16,517 INFO L93 Difference]: Finished difference Result 8625 states and 17120 transitions. [2021-11-07 02:28:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:28:16,517 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 02:28:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:16,526 INFO L225 Difference]: With dead ends: 8625 [2021-11-07 02:28:16,526 INFO L226 Difference]: Without dead ends: 8625 [2021-11-07 02:28:16,526 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:28:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2021-11-07 02:28:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 5107. [2021-11-07 02:28:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5107 states, 5035 states have (on average 2.016087388282026) internal successors, (10151), 5106 states have internal predecessors, (10151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 10151 transitions. [2021-11-07 02:28:16,600 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 10151 transitions. Word has length 24 [2021-11-07 02:28:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:16,601 INFO L470 AbstractCegarLoop]: Abstraction has 5107 states and 10151 transitions. [2021-11-07 02:28:16,601 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 02:28:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 10151 transitions. [2021-11-07 02:28:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:16,602 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:16,602 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 02:28:16,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-07 02:28:16,602 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1710154973, now seen corresponding path program 32 times [2021-11-07 02:28:16,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:16,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951062805] [2021-11-07 02:28:16,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:16,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:16,791 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 02:28:16,791 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:16,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951062805] [2021-11-07 02:28:16,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951062805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:16,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:16,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:28:16,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29730646] [2021-11-07 02:28:16,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:28:16,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:28:16,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:28:16,793 INFO L87 Difference]: Start difference. First operand 5107 states and 10151 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 02:28:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:18,015 INFO L93 Difference]: Finished difference Result 8616 states and 17102 transitions. [2021-11-07 02:28:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:28:18,016 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 02:28:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:18,025 INFO L225 Difference]: With dead ends: 8616 [2021-11-07 02:28:18,025 INFO L226 Difference]: Without dead ends: 8616 [2021-11-07 02:28:18,026 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:28:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2021-11-07 02:28:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 5110. [2021-11-07 02:28:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5110 states, 5038 states have (on average 2.0160778086542277) internal successors, (10157), 5109 states have internal predecessors, (10157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 10157 transitions. [2021-11-07 02:28:18,102 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 10157 transitions. Word has length 24 [2021-11-07 02:28:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:18,102 INFO L470 AbstractCegarLoop]: Abstraction has 5110 states and 10157 transitions. [2021-11-07 02:28:18,103 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 02:28:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 10157 transitions. [2021-11-07 02:28:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:18,103 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:18,104 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 02:28:18,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-07 02:28:18,104 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1705459403, now seen corresponding path program 33 times [2021-11-07 02:28:18,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:18,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363955849] [2021-11-07 02:28:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:18,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:18,294 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 02:28:18,294 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:18,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363955849] [2021-11-07 02:28:18,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363955849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:18,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:18,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:28:18,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338707421] [2021-11-07 02:28:18,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:28:18,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:28:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:28:18,296 INFO L87 Difference]: Start difference. First operand 5110 states and 10157 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 02:28:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:20,015 INFO L93 Difference]: Finished difference Result 8630 states and 17130 transitions. [2021-11-07 02:28:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:28:20,015 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 02:28:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:20,024 INFO L225 Difference]: With dead ends: 8630 [2021-11-07 02:28:20,024 INFO L226 Difference]: Without dead ends: 8630 [2021-11-07 02:28:20,024 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-11-07 02:28:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8630 states. [2021-11-07 02:28:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8630 to 5109. [2021-11-07 02:28:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 5037 states have (on average 2.0160810005955927) internal successors, (10155), 5108 states have internal predecessors, (10155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 10155 transitions. [2021-11-07 02:28:20,095 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 10155 transitions. Word has length 24 [2021-11-07 02:28:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:20,095 INFO L470 AbstractCegarLoop]: Abstraction has 5109 states and 10155 transitions. [2021-11-07 02:28:20,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 02:28:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 10155 transitions. [2021-11-07 02:28:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:20,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:20,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 02:28:20,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-07 02:28:20,097 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1558974173, now seen corresponding path program 34 times [2021-11-07 02:28:20,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:20,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947990488] [2021-11-07 02:28:20,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:20,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:20,244 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 02:28:20,244 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:20,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947990488] [2021-11-07 02:28:20,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947990488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:20,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:20,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:28:20,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675750152] [2021-11-07 02:28:20,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:28:20,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:28:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:28:20,245 INFO L87 Difference]: Start difference. First operand 5109 states and 10155 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 02:28:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:21,948 INFO L93 Difference]: Finished difference Result 8644 states and 17158 transitions. [2021-11-07 02:28:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:28:21,949 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 02:28:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:21,957 INFO L225 Difference]: With dead ends: 8644 [2021-11-07 02:28:21,958 INFO L226 Difference]: Without dead ends: 8644 [2021-11-07 02:28:21,958 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:28:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8644 states. [2021-11-07 02:28:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8644 to 5108. [2021-11-07 02:28:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5108 states, 5036 states have (on average 2.016084193804607) internal successors, (10153), 5107 states have internal predecessors, (10153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5108 states to 5108 states and 10153 transitions. [2021-11-07 02:28:22,029 INFO L78 Accepts]: Start accepts. Automaton has 5108 states and 10153 transitions. Word has length 24 [2021-11-07 02:28:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:22,030 INFO L470 AbstractCegarLoop]: Abstraction has 5108 states and 10153 transitions. [2021-11-07 02:28:22,030 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 02:28:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5108 states and 10153 transitions. [2021-11-07 02:28:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:22,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:22,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 02:28:22,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-07 02:28:22,032 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1227101259, now seen corresponding path program 35 times [2021-11-07 02:28:22,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:22,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231559768] [2021-11-07 02:28:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:22,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:22,170 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 02:28:22,170 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:22,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231559768] [2021-11-07 02:28:22,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231559768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:22,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:22,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:28:22,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349900920] [2021-11-07 02:28:22,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:28:22,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:22,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:28:22,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:28:22,172 INFO L87 Difference]: Start difference. First operand 5108 states and 10153 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 02:28:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:23,649 INFO L93 Difference]: Finished difference Result 8654 states and 17178 transitions. [2021-11-07 02:28:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:28:23,649 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 02:28:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:23,658 INFO L225 Difference]: With dead ends: 8654 [2021-11-07 02:28:23,658 INFO L226 Difference]: Without dead ends: 8654 [2021-11-07 02:28:23,658 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:28:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2021-11-07 02:28:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 5107. [2021-11-07 02:28:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5107 states, 5035 states have (on average 2.016087388282026) internal successors, (10151), 5106 states have internal predecessors, (10151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 10151 transitions. [2021-11-07 02:28:23,730 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 10151 transitions. Word has length 24 [2021-11-07 02:28:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:23,730 INFO L470 AbstractCegarLoop]: Abstraction has 5107 states and 10151 transitions. [2021-11-07 02:28:23,730 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 02:28:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 10151 transitions. [2021-11-07 02:28:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:23,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:23,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 02:28:23,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-11-07 02:28:23,732 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1430579869, now seen corresponding path program 36 times [2021-11-07 02:28:23,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:23,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875499757] [2021-11-07 02:28:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:23,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:24,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 02:28:24,032 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:24,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875499757] [2021-11-07 02:28:24,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875499757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:24,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:24,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:24,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237612729] [2021-11-07 02:28:24,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:24,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:24,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:24,033 INFO L87 Difference]: Start difference. First operand 5107 states and 10151 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:26,902 INFO L93 Difference]: Finished difference Result 14345 states and 28419 transitions. [2021-11-07 02:28:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:28:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:26,921 INFO L225 Difference]: With dead ends: 14345 [2021-11-07 02:28:26,921 INFO L226 Difference]: Without dead ends: 14345 [2021-11-07 02:28:26,921 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:28:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14345 states. [2021-11-07 02:28:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14345 to 5168. [2021-11-07 02:28:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5168 states, 5096 states have (on average 2.015894819466248) internal successors, (10273), 5167 states have internal predecessors, (10273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5168 states to 5168 states and 10273 transitions. [2021-11-07 02:28:27,044 INFO L78 Accepts]: Start accepts. Automaton has 5168 states and 10273 transitions. Word has length 24 [2021-11-07 02:28:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:27,044 INFO L470 AbstractCegarLoop]: Abstraction has 5168 states and 10273 transitions. [2021-11-07 02:28:27,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5168 states and 10273 transitions. [2021-11-07 02:28:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:27,045 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:27,046 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 02:28:27,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-11-07 02:28:27,046 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1222296709, now seen corresponding path program 37 times [2021-11-07 02:28:27,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:27,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344434367] [2021-11-07 02:28:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:27,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:27,308 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 02:28:27,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:27,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344434367] [2021-11-07 02:28:27,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344434367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:27,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:27,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:27,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907475215] [2021-11-07 02:28:27,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:27,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:27,310 INFO L87 Difference]: Start difference. First operand 5168 states and 10273 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:30,569 INFO L93 Difference]: Finished difference Result 14349 states and 28427 transitions. [2021-11-07 02:28:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:28:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:30,587 INFO L225 Difference]: With dead ends: 14349 [2021-11-07 02:28:30,587 INFO L226 Difference]: Without dead ends: 14349 [2021-11-07 02:28:30,587 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=608, Unknown=0, NotChecked=0, Total=870 [2021-11-07 02:28:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14349 states. [2021-11-07 02:28:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14349 to 5169. [2021-11-07 02:28:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5169 states, 5097 states have (on average 2.0158917010005886) internal successors, (10275), 5168 states have internal predecessors, (10275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 10275 transitions. [2021-11-07 02:28:30,716 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 10275 transitions. Word has length 24 [2021-11-07 02:28:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:30,716 INFO L470 AbstractCegarLoop]: Abstraction has 5169 states and 10275 transitions. [2021-11-07 02:28:30,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 10275 transitions. [2021-11-07 02:28:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:30,717 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:30,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] [2021-11-07 02:28:30,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-11-07 02:28:30,717 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1217601139, now seen corresponding path program 38 times [2021-11-07 02:28:30,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:30,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588544503] [2021-11-07 02:28:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:30,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:31,017 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 02:28:31,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:31,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588544503] [2021-11-07 02:28:31,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588544503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:31,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:31,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:31,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9941585] [2021-11-07 02:28:31,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:31,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:31,019 INFO L87 Difference]: Start difference. First operand 5169 states and 10275 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:34,133 INFO L93 Difference]: Finished difference Result 14358 states and 28445 transitions. [2021-11-07 02:28:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:28:34,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:34,151 INFO L225 Difference]: With dead ends: 14358 [2021-11-07 02:28:34,151 INFO L226 Difference]: Without dead ends: 14358 [2021-11-07 02:28:34,151 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=635, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:28:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14358 states. [2021-11-07 02:28:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14358 to 5161. [2021-11-07 02:28:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5161 states, 5089 states have (on average 2.015916683041855) internal successors, (10259), 5160 states have internal predecessors, (10259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 10259 transitions. [2021-11-07 02:28:34,282 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 10259 transitions. Word has length 24 [2021-11-07 02:28:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:34,282 INFO L470 AbstractCegarLoop]: Abstraction has 5161 states and 10259 transitions. [2021-11-07 02:28:34,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 10259 transitions. [2021-11-07 02:28:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:34,283 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:34,283 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 02:28:34,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-11-07 02:28:34,284 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash -868864029, now seen corresponding path program 39 times [2021-11-07 02:28:34,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:34,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624491217] [2021-11-07 02:28:34,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:34,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:34,556 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 02:28:34,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:34,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624491217] [2021-11-07 02:28:34,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624491217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:34,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:34,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:34,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593989175] [2021-11-07 02:28:34,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:34,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:34,557 INFO L87 Difference]: Start difference. First operand 5161 states and 10259 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:37,745 INFO L93 Difference]: Finished difference Result 14355 states and 28439 transitions. [2021-11-07 02:28:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:28:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:37,763 INFO L225 Difference]: With dead ends: 14355 [2021-11-07 02:28:37,763 INFO L226 Difference]: Without dead ends: 14355 [2021-11-07 02:28:37,764 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:28:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2021-11-07 02:28:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 5163. [2021-11-07 02:28:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5163 states, 5091 states have (on average 2.01591043017089) internal successors, (10263), 5162 states have internal predecessors, (10263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 10263 transitions. [2021-11-07 02:28:37,900 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 10263 transitions. Word has length 24 [2021-11-07 02:28:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:37,900 INFO L470 AbstractCegarLoop]: Abstraction has 5163 states and 10263 transitions. [2021-11-07 02:28:37,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 10263 transitions. [2021-11-07 02:28:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:37,901 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:37,901 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 02:28:37,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-11-07 02:28:37,901 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash -864168459, now seen corresponding path program 40 times [2021-11-07 02:28:37,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:37,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646316489] [2021-11-07 02:28:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:37,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:38,196 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 02:28:38,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:38,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646316489] [2021-11-07 02:28:38,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646316489] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:38,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:38,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:38,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147144804] [2021-11-07 02:28:38,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:38,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:38,197 INFO L87 Difference]: Start difference. First operand 5163 states and 10263 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:41,425 INFO L93 Difference]: Finished difference Result 14364 states and 28457 transitions. [2021-11-07 02:28:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 02:28:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:41,444 INFO L225 Difference]: With dead ends: 14364 [2021-11-07 02:28:41,444 INFO L226 Difference]: Without dead ends: 14364 [2021-11-07 02:28:41,444 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=680, Unknown=0, NotChecked=0, Total=992 [2021-11-07 02:28:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14364 states. [2021-11-07 02:28:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14364 to 5162. [2021-11-07 02:28:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5162 states, 5090 states have (on average 2.0159135559921415) internal successors, (10261), 5161 states have internal predecessors, (10261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5162 states to 5162 states and 10261 transitions. [2021-11-07 02:28:41,639 INFO L78 Accepts]: Start accepts. Automaton has 5162 states and 10261 transitions. Word has length 24 [2021-11-07 02:28:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:41,640 INFO L470 AbstractCegarLoop]: Abstraction has 5162 states and 10261 transitions. [2021-11-07 02:28:41,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5162 states and 10261 transitions. [2021-11-07 02:28:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:41,641 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:41,641 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 02:28:41,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-11-07 02:28:41,642 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:41,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash -717683229, now seen corresponding path program 41 times [2021-11-07 02:28:41,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:41,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466205976] [2021-11-07 02:28:41,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:41,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:41,892 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 02:28:41,892 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:41,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466205976] [2021-11-07 02:28:41,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466205976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:41,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:41,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:41,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934102351] [2021-11-07 02:28:41,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:41,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:41,893 INFO L87 Difference]: Start difference. First operand 5162 states and 10261 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:44,511 INFO L93 Difference]: Finished difference Result 14371 states and 28471 transitions. [2021-11-07 02:28:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:28:44,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:44,529 INFO L225 Difference]: With dead ends: 14371 [2021-11-07 02:28:44,529 INFO L226 Difference]: Without dead ends: 14371 [2021-11-07 02:28:44,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=346, Invalid=710, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 02:28:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14371 states. [2021-11-07 02:28:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14371 to 5154. [2021-11-07 02:28:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5082 states have (on average 2.0159386068476977) internal successors, (10245), 5153 states have internal predecessors, (10245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 10245 transitions. [2021-11-07 02:28:44,633 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 10245 transitions. Word has length 24 [2021-11-07 02:28:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:44,633 INFO L470 AbstractCegarLoop]: Abstraction has 5154 states and 10245 transitions. [2021-11-07 02:28:44,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 10245 transitions. [2021-11-07 02:28:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:44,634 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:44,635 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 02:28:44,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-11-07 02:28:44,635 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1272471803, now seen corresponding path program 42 times [2021-11-07 02:28:44,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:44,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946272932] [2021-11-07 02:28:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:44,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:44,903 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 02:28:44,903 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:44,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946272932] [2021-11-07 02:28:44,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946272932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:44,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:44,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:44,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398204250] [2021-11-07 02:28:44,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:44,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:44,904 INFO L87 Difference]: Start difference. First operand 5154 states and 10245 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:46,690 INFO L93 Difference]: Finished difference Result 14351 states and 28431 transitions. [2021-11-07 02:28:46,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:28:46,690 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:46,707 INFO L225 Difference]: With dead ends: 14351 [2021-11-07 02:28:46,707 INFO L226 Difference]: Without dead ends: 14351 [2021-11-07 02:28:46,707 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:28:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14351 states. [2021-11-07 02:28:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14351 to 5157. [2021-11-07 02:28:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5157 states, 5085 states have (on average 2.015929203539823) internal successors, (10251), 5156 states have internal predecessors, (10251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5157 states to 5157 states and 10251 transitions. [2021-11-07 02:28:46,808 INFO L78 Accepts]: Start accepts. Automaton has 5157 states and 10251 transitions. Word has length 24 [2021-11-07 02:28:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:46,808 INFO L470 AbstractCegarLoop]: Abstraction has 5157 states and 10251 transitions. [2021-11-07 02:28:46,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5157 states and 10251 transitions. [2021-11-07 02:28:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:46,809 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:46,809 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 02:28:46,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-11-07 02:28:46,810 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1277167373, now seen corresponding path program 43 times [2021-11-07 02:28:46,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:46,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030452119] [2021-11-07 02:28:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:46,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:47,042 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 02:28:47,042 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:47,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030452119] [2021-11-07 02:28:47,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030452119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:47,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:47,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:47,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854347036] [2021-11-07 02:28:47,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:47,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:47,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:47,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:47,044 INFO L87 Difference]: Start difference. First operand 5157 states and 10251 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:49,462 INFO L93 Difference]: Finished difference Result 14364 states and 28457 transitions. [2021-11-07 02:28:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:28:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:49,480 INFO L225 Difference]: With dead ends: 14364 [2021-11-07 02:28:49,480 INFO L226 Difference]: Without dead ends: 14364 [2021-11-07 02:28:49,480 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=488, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:28:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14364 states. [2021-11-07 02:28:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14364 to 5156. [2021-11-07 02:28:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 5084 states have (on average 2.0159323367427224) internal successors, (10249), 5155 states have internal predecessors, (10249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 10249 transitions. [2021-11-07 02:28:49,583 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 10249 transitions. Word has length 24 [2021-11-07 02:28:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:49,583 INFO L470 AbstractCegarLoop]: Abstraction has 5156 states and 10249 transitions. [2021-11-07 02:28:49,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 10249 transitions. [2021-11-07 02:28:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:49,585 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:49,585 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 02:28:49,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-11-07 02:28:49,585 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1423652603, now seen corresponding path program 44 times [2021-11-07 02:28:49,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:49,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96775914] [2021-11-07 02:28:49,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:49,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:49,806 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 02:28:49,806 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:49,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96775914] [2021-11-07 02:28:49,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96775914] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:49,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:49,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:49,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407410750] [2021-11-07 02:28:49,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:49,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:49,807 INFO L87 Difference]: Start difference. First operand 5156 states and 10249 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:52,679 INFO L93 Difference]: Finished difference Result 14371 states and 28471 transitions. [2021-11-07 02:28:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 02:28:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:52,697 INFO L225 Difference]: With dead ends: 14371 [2021-11-07 02:28:52,697 INFO L226 Difference]: Without dead ends: 14371 [2021-11-07 02:28:52,698 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=761, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 02:28:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14371 states. [2021-11-07 02:28:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14371 to 5155. [2021-11-07 02:28:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5083 states have (on average 2.015935471178438) internal successors, (10247), 5154 states have internal predecessors, (10247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 10247 transitions. [2021-11-07 02:28:52,792 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 10247 transitions. Word has length 24 [2021-11-07 02:28:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:52,792 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 10247 transitions. [2021-11-07 02:28:52,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 10247 transitions. [2021-11-07 02:28:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:52,793 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:52,794 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 02:28:52,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-11-07 02:28:52,794 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1755525517, now seen corresponding path program 45 times [2021-11-07 02:28:52,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:52,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976615516] [2021-11-07 02:28:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:52,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:53,008 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 02:28:53,009 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:53,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976615516] [2021-11-07 02:28:53,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976615516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:53,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:53,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:28:53,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417724292] [2021-11-07 02:28:53,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:28:53,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:28:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:28:53,010 INFO L87 Difference]: Start difference. First operand 5155 states and 10247 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:56,163 INFO L93 Difference]: Finished difference Result 14360 states and 28445 transitions. [2021-11-07 02:28:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 02:28:56,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:28:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:56,179 INFO L225 Difference]: With dead ends: 14360 [2021-11-07 02:28:56,180 INFO L226 Difference]: Without dead ends: 14360 [2021-11-07 02:28:56,180 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=812, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 02:28:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14360 states. [2021-11-07 02:28:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14360 to 5142. [2021-11-07 02:28:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5142 states, 5070 states have (on average 2.015976331360947) internal successors, (10221), 5141 states have internal predecessors, (10221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 10221 transitions. [2021-11-07 02:28:56,271 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 10221 transitions. Word has length 24 [2021-11-07 02:28:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:56,272 INFO L470 AbstractCegarLoop]: Abstraction has 5142 states and 10221 transitions. [2021-11-07 02:28:56,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 10221 transitions. [2021-11-07 02:28:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:56,273 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:56,273 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 02:28:56,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-11-07 02:28:56,273 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -538531114, now seen corresponding path program 7 times [2021-11-07 02:28:56,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:56,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802291307] [2021-11-07 02:28:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:56,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:56,674 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 02:28:56,674 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:56,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802291307] [2021-11-07 02:28:56,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802291307] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:56,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:56,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:28:56,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456649946] [2021-11-07 02:28:56,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:28:56,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:28:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:28:56,675 INFO L87 Difference]: Start difference. First operand 5142 states and 10221 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 02:28:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:28:58,599 INFO L93 Difference]: Finished difference Result 10306 states and 20418 transitions. [2021-11-07 02:28:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:28:58,600 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 02:28:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:28:58,612 INFO L225 Difference]: With dead ends: 10306 [2021-11-07 02:28:58,612 INFO L226 Difference]: Without dead ends: 10306 [2021-11-07 02:28:58,613 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:28:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10306 states. [2021-11-07 02:28:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10306 to 5169. [2021-11-07 02:28:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5169 states, 5097 states have (on average 2.0158917010005886) internal successors, (10275), 5168 states have internal predecessors, (10275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:28:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 10275 transitions. [2021-11-07 02:28:58,741 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 10275 transitions. Word has length 24 [2021-11-07 02:28:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:28:58,742 INFO L470 AbstractCegarLoop]: Abstraction has 5169 states and 10275 transitions. [2021-11-07 02:28:58,742 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 02:28:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 10275 transitions. [2021-11-07 02:28:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:28:58,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:28:58,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 02:28:58,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-11-07 02:28:58,743 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:28:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:28:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1538480908, now seen corresponding path program 8 times [2021-11-07 02:28:58,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:28:58,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081024931] [2021-11-07 02:28:58,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:28:58,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:28:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:28:59,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 02:28:59,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:28:59,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081024931] [2021-11-07 02:28:59,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081024931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:28:59,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:28:59,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:28:59,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170108012] [2021-11-07 02:28:59,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:28:59,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:28:59,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:28:59,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:28:59,111 INFO L87 Difference]: Start difference. First operand 5169 states and 10275 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 02:29:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:01,931 INFO L93 Difference]: Finished difference Result 10186 states and 20171 transitions. [2021-11-07 02:29:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:29:01,932 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 02:29:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:01,943 INFO L225 Difference]: With dead ends: 10186 [2021-11-07 02:29:01,943 INFO L226 Difference]: Without dead ends: 10186 [2021-11-07 02:29:01,943 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:29:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10186 states. [2021-11-07 02:29:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10186 to 5156. [2021-11-07 02:29:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 5084 states have (on average 2.0159323367427224) internal successors, (10249), 5155 states have internal predecessors, (10249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 10249 transitions. [2021-11-07 02:29:02,026 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 10249 transitions. Word has length 24 [2021-11-07 02:29:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:02,026 INFO L470 AbstractCegarLoop]: Abstraction has 5156 states and 10249 transitions. [2021-11-07 02:29:02,026 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 02:29:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 10249 transitions. [2021-11-07 02:29:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:02,027 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:02,027 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 02:29:02,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-11-07 02:29:02,028 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1355967557, now seen corresponding path program 2 times [2021-11-07 02:29:02,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:02,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333191475] [2021-11-07 02:29:02,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:02,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:02,212 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 02:29:02,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:02,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333191475] [2021-11-07 02:29:02,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333191475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:02,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:02,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:02,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290565227] [2021-11-07 02:29:02,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:02,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:02,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:02,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:02,214 INFO L87 Difference]: Start difference. First operand 5156 states and 10249 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 02:29:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:04,047 INFO L93 Difference]: Finished difference Result 16214 states and 32175 transitions. [2021-11-07 02:29:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:29:04,048 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 02:29:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:04,069 INFO L225 Difference]: With dead ends: 16214 [2021-11-07 02:29:04,069 INFO L226 Difference]: Without dead ends: 16214 [2021-11-07 02:29:04,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:29:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16214 states. [2021-11-07 02:29:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16214 to 5175. [2021-11-07 02:29:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 5103 states have (on average 2.015873015873016) internal successors, (10287), 5174 states have internal predecessors, (10287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 10287 transitions. [2021-11-07 02:29:04,185 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 10287 transitions. Word has length 24 [2021-11-07 02:29:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:04,185 INFO L470 AbstractCegarLoop]: Abstraction has 5175 states and 10287 transitions. [2021-11-07 02:29:04,185 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 02:29:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 10287 transitions. [2021-11-07 02:29:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:04,186 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:04,186 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 02:29:04,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-11-07 02:29:04,186 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1630136737, now seen corresponding path program 46 times [2021-11-07 02:29:04,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:04,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201338384] [2021-11-07 02:29:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:04,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:04,323 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 02:29:04,323 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:04,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201338384] [2021-11-07 02:29:04,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201338384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:04,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:04,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:04,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747147814] [2021-11-07 02:29:04,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:04,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:04,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:04,325 INFO L87 Difference]: Start difference. First operand 5175 states and 10287 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 02:29:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:06,036 INFO L93 Difference]: Finished difference Result 15822 states and 31399 transitions. [2021-11-07 02:29:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:29:06,036 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 02:29:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:06,056 INFO L225 Difference]: With dead ends: 15822 [2021-11-07 02:29:06,056 INFO L226 Difference]: Without dead ends: 15822 [2021-11-07 02:29:06,056 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:29:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15822 states. [2021-11-07 02:29:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15822 to 5218. [2021-11-07 02:29:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5218 states, 5146 states have (on average 2.017489312087058) internal successors, (10382), 5217 states have internal predecessors, (10382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 10382 transitions. [2021-11-07 02:29:06,169 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 10382 transitions. Word has length 24 [2021-11-07 02:29:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:06,169 INFO L470 AbstractCegarLoop]: Abstraction has 5218 states and 10382 transitions. [2021-11-07 02:29:06,169 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 02:29:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 10382 transitions. [2021-11-07 02:29:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:06,170 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:06,171 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 02:29:06,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-11-07 02:29:06,171 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2015471889, now seen corresponding path program 47 times [2021-11-07 02:29:06,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:06,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230013521] [2021-11-07 02:29:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:06,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:06,357 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 02:29:06,357 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:06,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230013521] [2021-11-07 02:29:06,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230013521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:06,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:06,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:06,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209708234] [2021-11-07 02:29:06,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:06,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:06,359 INFO L87 Difference]: Start difference. First operand 5218 states and 10382 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 02:29:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:07,675 INFO L93 Difference]: Finished difference Result 12467 states and 24755 transitions. [2021-11-07 02:29:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:29:07,676 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 02:29:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:07,690 INFO L225 Difference]: With dead ends: 12467 [2021-11-07 02:29:07,690 INFO L226 Difference]: Without dead ends: 12467 [2021-11-07 02:29:07,691 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:29:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12467 states. [2021-11-07 02:29:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12467 to 5221. [2021-11-07 02:29:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5221 states, 5149 states have (on average 2.0174791221596426) internal successors, (10388), 5220 states have internal predecessors, (10388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5221 states to 5221 states and 10388 transitions. [2021-11-07 02:29:07,777 INFO L78 Accepts]: Start accepts. Automaton has 5221 states and 10388 transitions. Word has length 24 [2021-11-07 02:29:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:07,777 INFO L470 AbstractCegarLoop]: Abstraction has 5221 states and 10388 transitions. [2021-11-07 02:29:07,777 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 02:29:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5221 states and 10388 transitions. [2021-11-07 02:29:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:07,778 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:07,778 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 02:29:07,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-11-07 02:29:07,778 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2020167459, now seen corresponding path program 48 times [2021-11-07 02:29:07,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:07,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127369365] [2021-11-07 02:29:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:07,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:07,957 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 02:29:07,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:07,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127369365] [2021-11-07 02:29:07,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127369365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:07,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:07,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:07,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105736265] [2021-11-07 02:29:07,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:07,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:07,958 INFO L87 Difference]: Start difference. First operand 5221 states and 10388 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 02:29:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:09,730 INFO L93 Difference]: Finished difference Result 12481 states and 24783 transitions. [2021-11-07 02:29:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:29:09,730 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 02:29:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:09,746 INFO L225 Difference]: With dead ends: 12481 [2021-11-07 02:29:09,746 INFO L226 Difference]: Without dead ends: 12481 [2021-11-07 02:29:09,746 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-11-07 02:29:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12481 states. [2021-11-07 02:29:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12481 to 5220. [2021-11-07 02:29:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5220 states, 5148 states have (on average 2.0174825174825175) internal successors, (10386), 5219 states have internal predecessors, (10386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 10386 transitions. [2021-11-07 02:29:09,842 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 10386 transitions. Word has length 24 [2021-11-07 02:29:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:09,842 INFO L470 AbstractCegarLoop]: Abstraction has 5220 states and 10386 transitions. [2021-11-07 02:29:09,842 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 02:29:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 10386 transitions. [2021-11-07 02:29:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:09,843 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:09,843 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 02:29:09,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-11-07 02:29:09,843 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2128314607, now seen corresponding path program 49 times [2021-11-07 02:29:09,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:09,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425212466] [2021-11-07 02:29:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:09,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:09,987 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 02:29:09,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:09,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425212466] [2021-11-07 02:29:09,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425212466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:09,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:09,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:09,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801323226] [2021-11-07 02:29:09,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:09,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:09,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:09,988 INFO L87 Difference]: Start difference. First operand 5220 states and 10386 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 02:29:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:11,625 INFO L93 Difference]: Finished difference Result 12495 states and 24811 transitions. [2021-11-07 02:29:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:29:11,626 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 02:29:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:11,641 INFO L225 Difference]: With dead ends: 12495 [2021-11-07 02:29:11,641 INFO L226 Difference]: Without dead ends: 12495 [2021-11-07 02:29:11,641 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:29:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12495 states. [2021-11-07 02:29:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12495 to 5219. [2021-11-07 02:29:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5147 states have (on average 2.017485914124733) internal successors, (10384), 5218 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 10384 transitions. [2021-11-07 02:29:11,735 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 10384 transitions. Word has length 24 [2021-11-07 02:29:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:11,736 INFO L470 AbstractCegarLoop]: Abstraction has 5219 states and 10384 transitions. [2021-11-07 02:29:11,736 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 02:29:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 10384 transitions. [2021-11-07 02:29:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:11,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:11,737 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 02:29:11,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-11-07 02:29:11,737 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1796441693, now seen corresponding path program 50 times [2021-11-07 02:29:11,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:11,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274863442] [2021-11-07 02:29:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:11,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:11,878 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 02:29:11,879 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:11,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274863442] [2021-11-07 02:29:11,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274863442] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:11,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:11,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:11,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123912437] [2021-11-07 02:29:11,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:11,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:11,881 INFO L87 Difference]: Start difference. First operand 5219 states and 10384 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 02:29:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:13,593 INFO L93 Difference]: Finished difference Result 12489 states and 24795 transitions. [2021-11-07 02:29:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:29:13,593 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 02:29:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:13,609 INFO L225 Difference]: With dead ends: 12489 [2021-11-07 02:29:13,609 INFO L226 Difference]: Without dead ends: 12489 [2021-11-07 02:29:13,609 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:29:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12489 states. [2021-11-07 02:29:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12489 to 5218. [2021-11-07 02:29:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5218 states, 5146 states have (on average 2.017489312087058) internal successors, (10382), 5217 states have internal predecessors, (10382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 10382 transitions. [2021-11-07 02:29:13,704 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 10382 transitions. Word has length 24 [2021-11-07 02:29:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:13,704 INFO L470 AbstractCegarLoop]: Abstraction has 5218 states and 10382 transitions. [2021-11-07 02:29:13,704 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 02:29:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 10382 transitions. [2021-11-07 02:29:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:13,706 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:13,706 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 02:29:13,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-11-07 02:29:13,706 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2018282025, now seen corresponding path program 3 times [2021-11-07 02:29:13,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:13,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269278829] [2021-11-07 02:29:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:13,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:13,881 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 02:29:13,882 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:13,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269278829] [2021-11-07 02:29:13,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269278829] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:13,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:13,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:13,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790053277] [2021-11-07 02:29:13,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:13,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:13,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:13,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:13,883 INFO L87 Difference]: Start difference. First operand 5218 states and 10382 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 02:29:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:15,491 INFO L93 Difference]: Finished difference Result 9502 states and 18888 transitions. [2021-11-07 02:29:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:29:15,492 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 02:29:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:15,501 INFO L225 Difference]: With dead ends: 9502 [2021-11-07 02:29:15,501 INFO L226 Difference]: Without dead ends: 9502 [2021-11-07 02:29:15,501 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:29:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9502 states. [2021-11-07 02:29:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9502 to 5236. [2021-11-07 02:29:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 5164 states have (on average 2.017428350116189) internal successors, (10418), 5235 states have internal predecessors, (10418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 10418 transitions. [2021-11-07 02:29:15,575 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 10418 transitions. Word has length 24 [2021-11-07 02:29:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:15,575 INFO L470 AbstractCegarLoop]: Abstraction has 5236 states and 10418 transitions. [2021-11-07 02:29:15,575 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 02:29:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 10418 transitions. [2021-11-07 02:29:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:15,576 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:15,576 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 02:29:15,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-11-07 02:29:15,576 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash -492688437, now seen corresponding path program 4 times [2021-11-07 02:29:15,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:15,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672550071] [2021-11-07 02:29:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:15,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:15,742 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 02:29:15,742 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:15,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672550071] [2021-11-07 02:29:15,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672550071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:15,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:15,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:15,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913005098] [2021-11-07 02:29:15,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:15,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:15,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:15,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:15,743 INFO L87 Difference]: Start difference. First operand 5236 states and 10418 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 02:29:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:17,799 INFO L93 Difference]: Finished difference Result 9461 states and 18806 transitions. [2021-11-07 02:29:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:29:17,800 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 02:29:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:17,810 INFO L225 Difference]: With dead ends: 9461 [2021-11-07 02:29:17,810 INFO L226 Difference]: Without dead ends: 9461 [2021-11-07 02:29:17,810 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:29:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2021-11-07 02:29:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 5237. [2021-11-07 02:29:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5237 states, 5165 states have (on average 2.0174249757986447) internal successors, (10420), 5236 states have internal predecessors, (10420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5237 states to 5237 states and 10420 transitions. [2021-11-07 02:29:17,889 INFO L78 Accepts]: Start accepts. Automaton has 5237 states and 10420 transitions. Word has length 24 [2021-11-07 02:29:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:17,889 INFO L470 AbstractCegarLoop]: Abstraction has 5237 states and 10420 transitions. [2021-11-07 02:29:17,889 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 02:29:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5237 states and 10420 transitions. [2021-11-07 02:29:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:17,890 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:17,890 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 02:29:17,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-11-07 02:29:17,890 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -743826567, now seen corresponding path program 5 times [2021-11-07 02:29:17,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:17,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689163176] [2021-11-07 02:29:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:17,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:18,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 02:29:18,047 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:18,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689163176] [2021-11-07 02:29:18,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689163176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:18,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:18,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:18,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300512792] [2021-11-07 02:29:18,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:18,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:18,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:18,048 INFO L87 Difference]: Start difference. First operand 5237 states and 10420 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 02:29:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:20,017 INFO L93 Difference]: Finished difference Result 9352 states and 18588 transitions. [2021-11-07 02:29:20,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:29:20,018 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 02:29:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:20,057 INFO L225 Difference]: With dead ends: 9352 [2021-11-07 02:29:20,057 INFO L226 Difference]: Without dead ends: 9352 [2021-11-07 02:29:20,057 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:29:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9352 states. [2021-11-07 02:29:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9352 to 5239. [2021-11-07 02:29:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5239 states, 5167 states have (on average 2.017418231081866) internal successors, (10424), 5238 states have internal predecessors, (10424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 10424 transitions. [2021-11-07 02:29:20,122 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 10424 transitions. Word has length 24 [2021-11-07 02:29:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:20,123 INFO L470 AbstractCegarLoop]: Abstraction has 5239 states and 10424 transitions. [2021-11-07 02:29:20,123 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 02:29:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 10424 transitions. [2021-11-07 02:29:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:20,123 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:20,124 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 02:29:20,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-11-07 02:29:20,124 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2046825033, now seen corresponding path program 6 times [2021-11-07 02:29:20,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:20,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785326365] [2021-11-07 02:29:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:20,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:20,268 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 02:29:20,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:20,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785326365] [2021-11-07 02:29:20,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785326365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:20,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:20,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:20,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414247915] [2021-11-07 02:29:20,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:20,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:20,270 INFO L87 Difference]: Start difference. First operand 5239 states and 10424 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 02:29:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:22,479 INFO L93 Difference]: Finished difference Result 12631 states and 25078 transitions. [2021-11-07 02:29:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:29:22,480 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 02:29:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:22,495 INFO L225 Difference]: With dead ends: 12631 [2021-11-07 02:29:22,496 INFO L226 Difference]: Without dead ends: 12631 [2021-11-07 02:29:22,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:29:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12631 states. [2021-11-07 02:29:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12631 to 5240. [2021-11-07 02:29:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 5168 states have (on average 2.0174148606811144) internal successors, (10426), 5239 states have internal predecessors, (10426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 10426 transitions. [2021-11-07 02:29:22,592 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 10426 transitions. Word has length 24 [2021-11-07 02:29:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:22,592 INFO L470 AbstractCegarLoop]: Abstraction has 5240 states and 10426 transitions. [2021-11-07 02:29:22,592 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 02:29:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 10426 transitions. [2021-11-07 02:29:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:22,593 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:22,593 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 02:29:22,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-11-07 02:29:22,593 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1772655853, now seen corresponding path program 51 times [2021-11-07 02:29:22,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:22,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165486839] [2021-11-07 02:29:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:22,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:22,727 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 02:29:22,727 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:22,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165486839] [2021-11-07 02:29:22,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165486839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:22,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:22,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:29:22,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633293185] [2021-11-07 02:29:22,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:29:22,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:22,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:29:22,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:29:22,729 INFO L87 Difference]: Start difference. First operand 5240 states and 10426 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 02:29:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:24,252 INFO L93 Difference]: Finished difference Result 12209 states and 24240 transitions. [2021-11-07 02:29:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:29:24,253 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 02:29:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:24,269 INFO L225 Difference]: With dead ends: 12209 [2021-11-07 02:29:24,269 INFO L226 Difference]: Without dead ends: 12209 [2021-11-07 02:29:24,269 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:29:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2021-11-07 02:29:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 5234. [2021-11-07 02:29:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5162 states have (on average 2.01762882603642) internal successors, (10415), 5233 states have internal predecessors, (10415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 10415 transitions. [2021-11-07 02:29:24,386 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 10415 transitions. Word has length 24 [2021-11-07 02:29:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:24,386 INFO L470 AbstractCegarLoop]: Abstraction has 5234 states and 10415 transitions. [2021-11-07 02:29:24,386 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 02:29:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 10415 transitions. [2021-11-07 02:29:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:24,387 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:24,387 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 02:29:24,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-11-07 02:29:24,387 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1698471474, now seen corresponding path program 9 times [2021-11-07 02:29:24,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:24,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517169300] [2021-11-07 02:29:24,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:24,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:24,899 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 02:29:24,899 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:24,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517169300] [2021-11-07 02:29:24,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517169300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:24,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:24,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:24,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223834059] [2021-11-07 02:29:24,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:24,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:24,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:24,901 INFO L87 Difference]: Start difference. First operand 5234 states and 10415 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 02:29:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:26,678 INFO L93 Difference]: Finished difference Result 10073 states and 19959 transitions. [2021-11-07 02:29:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:29:26,678 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 02:29:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:26,690 INFO L225 Difference]: With dead ends: 10073 [2021-11-07 02:29:26,690 INFO L226 Difference]: Without dead ends: 10073 [2021-11-07 02:29:26,690 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:29:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10073 states. [2021-11-07 02:29:26,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10073 to 5260. [2021-11-07 02:29:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5188 states have (on average 2.0175404780262145) internal successors, (10467), 5259 states have internal predecessors, (10467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 10467 transitions. [2021-11-07 02:29:26,773 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 10467 transitions. Word has length 24 [2021-11-07 02:29:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:26,773 INFO L470 AbstractCegarLoop]: Abstraction has 5260 states and 10467 transitions. [2021-11-07 02:29:26,773 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 02:29:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 10467 transitions. [2021-11-07 02:29:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:26,774 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:26,774 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 02:29:26,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-11-07 02:29:26,774 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash -519483800, now seen corresponding path program 10 times [2021-11-07 02:29:26,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:26,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904567656] [2021-11-07 02:29:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:26,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29: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 02:29:27,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:27,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904567656] [2021-11-07 02:29:27,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904567656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:27,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:27,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:27,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375373736] [2021-11-07 02:29:27,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:27,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:27,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:27,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:27,147 INFO L87 Difference]: Start difference. First operand 5260 states and 10467 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 02:29:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:30,819 INFO L93 Difference]: Finished difference Result 10093 states and 19999 transitions. [2021-11-07 02:29:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:29:30,819 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 02:29:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:30,831 INFO L225 Difference]: With dead ends: 10093 [2021-11-07 02:29:30,831 INFO L226 Difference]: Without dead ends: 10093 [2021-11-07 02:29:30,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:29:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2021-11-07 02:29:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 5244. [2021-11-07 02:29:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 5172 states have (on average 2.0175947409126063) internal successors, (10435), 5243 states have internal predecessors, (10435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 10435 transitions. [2021-11-07 02:29:30,913 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 10435 transitions. Word has length 24 [2021-11-07 02:29:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:30,914 INFO L470 AbstractCegarLoop]: Abstraction has 5244 states and 10435 transitions. [2021-11-07 02:29:30,914 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 02:29:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 10435 transitions. [2021-11-07 02:29:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:30,914 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:30,914 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 02:29:30,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-11-07 02:29:30,915 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1805025882, now seen corresponding path program 11 times [2021-11-07 02:29:30,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:30,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798191184] [2021-11-07 02:29:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:30,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:31,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 02:29:31,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:31,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798191184] [2021-11-07 02:29:31,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798191184] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:31,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:31,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:31,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555564814] [2021-11-07 02:29:31,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:31,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:31,309 INFO L87 Difference]: Start difference. First operand 5244 states and 10435 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 02:29:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:33,723 INFO L93 Difference]: Finished difference Result 10125 states and 20063 transitions. [2021-11-07 02:29:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:29:33,723 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 02:29:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:33,734 INFO L225 Difference]: With dead ends: 10125 [2021-11-07 02:29:33,734 INFO L226 Difference]: Without dead ends: 10125 [2021-11-07 02:29:33,734 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:29:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2021-11-07 02:29:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 5231. [2021-11-07 02:29:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5159 states have (on average 2.01763907734057) internal successors, (10409), 5230 states have internal predecessors, (10409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 10409 transitions. [2021-11-07 02:29:33,810 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 10409 transitions. Word has length 24 [2021-11-07 02:29:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:33,810 INFO L470 AbstractCegarLoop]: Abstraction has 5231 states and 10409 transitions. [2021-11-07 02:29:33,810 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 02:29:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 10409 transitions. [2021-11-07 02:29:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:33,811 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:33,811 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 02:29:33,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-11-07 02:29:33,811 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1432625874, now seen corresponding path program 12 times [2021-11-07 02:29:33,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:33,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026485514] [2021-11-07 02:29:33,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:33,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:34,218 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 02:29:34,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:34,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026485514] [2021-11-07 02:29:34,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026485514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:34,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:34,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:34,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639704385] [2021-11-07 02:29:34,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:34,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:34,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:34,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:34,219 INFO L87 Difference]: Start difference. First operand 5231 states and 10409 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 02:29:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:36,587 INFO L93 Difference]: Finished difference Result 10098 states and 20009 transitions. [2021-11-07 02:29:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:29:36,588 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 02:29:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:36,598 INFO L225 Difference]: With dead ends: 10098 [2021-11-07 02:29:36,598 INFO L226 Difference]: Without dead ends: 10098 [2021-11-07 02:29:36,598 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:29:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2021-11-07 02:29:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 5270. [2021-11-07 02:29:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5270 states, 5198 states have (on average 2.0175067333589842) internal successors, (10487), 5269 states have internal predecessors, (10487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 10487 transitions. [2021-11-07 02:29:36,675 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 10487 transitions. Word has length 24 [2021-11-07 02:29:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:36,675 INFO L470 AbstractCegarLoop]: Abstraction has 5270 states and 10487 transitions. [2021-11-07 02:29:36,675 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 02:29:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 10487 transitions. [2021-11-07 02:29:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:36,676 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:36,676 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 02:29:36,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-11-07 02:29:36,676 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash -785329400, now seen corresponding path program 13 times [2021-11-07 02:29:36,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:36,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460822629] [2021-11-07 02:29:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:36,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:37,025 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 02:29:37,025 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:37,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460822629] [2021-11-07 02:29:37,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460822629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:37,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:37,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:37,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172502760] [2021-11-07 02:29:37,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:37,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:37,026 INFO L87 Difference]: Start difference. First operand 5270 states and 10487 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 02:29:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:39,488 INFO L93 Difference]: Finished difference Result 10112 states and 20037 transitions. [2021-11-07 02:29:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:29:39,488 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 02:29:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:39,497 INFO L225 Difference]: With dead ends: 10112 [2021-11-07 02:29:39,497 INFO L226 Difference]: Without dead ends: 10112 [2021-11-07 02:29:39,497 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:29:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2021-11-07 02:29:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 5257. [2021-11-07 02:29:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5185 states have (on average 2.0175506268081005) internal successors, (10461), 5256 states have internal predecessors, (10461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 10461 transitions. [2021-11-07 02:29:39,563 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 10461 transitions. Word has length 24 [2021-11-07 02:29:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:39,563 INFO L470 AbstractCegarLoop]: Abstraction has 5257 states and 10461 transitions. [2021-11-07 02:29:39,563 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 02:29:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 10461 transitions. [2021-11-07 02:29:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:39,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:39,564 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 02:29:39,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-11-07 02:29:39,564 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1539180282, now seen corresponding path program 14 times [2021-11-07 02:29:39,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:39,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552740306] [2021-11-07 02:29:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:39,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:39,941 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 02:29:39,941 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:39,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552740306] [2021-11-07 02:29:39,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552740306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:39,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:39,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:39,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169722023] [2021-11-07 02:29:39,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:39,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:39,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:39,942 INFO L87 Difference]: Start difference. First operand 5257 states and 10461 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 02:29:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:42,356 INFO L93 Difference]: Finished difference Result 10153 states and 20119 transitions. [2021-11-07 02:29:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:29:42,356 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 02:29:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:42,367 INFO L225 Difference]: With dead ends: 10153 [2021-11-07 02:29:42,367 INFO L226 Difference]: Without dead ends: 10153 [2021-11-07 02:29:42,367 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:29:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2021-11-07 02:29:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 5241. [2021-11-07 02:29:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5169 states have (on average 2.0176049526020505) internal successors, (10429), 5240 states have internal predecessors, (10429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 10429 transitions. [2021-11-07 02:29:42,444 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 10429 transitions. Word has length 24 [2021-11-07 02:29:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:42,444 INFO L470 AbstractCegarLoop]: Abstraction has 5241 states and 10429 transitions. [2021-11-07 02:29:42,444 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 02:29:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 10429 transitions. [2021-11-07 02:29:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:42,445 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:42,445 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 02:29:42,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-11-07 02:29:42,445 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 156657740, now seen corresponding path program 15 times [2021-11-07 02:29:42,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:42,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242292388] [2021-11-07 02:29:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:42,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:42,712 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 02:29:42,712 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:42,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242292388] [2021-11-07 02:29:42,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242292388] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:42,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:42,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:42,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486197549] [2021-11-07 02:29:42,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:42,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:42,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:42,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:42,713 INFO L87 Difference]: Start difference. First operand 5241 states and 10429 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 02:29:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:44,377 INFO L93 Difference]: Finished difference Result 10166 states and 20145 transitions. [2021-11-07 02:29:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:29:44,378 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 02:29:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:44,388 INFO L225 Difference]: With dead ends: 10166 [2021-11-07 02:29:44,388 INFO L226 Difference]: Without dead ends: 10166 [2021-11-07 02:29:44,388 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:29:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10166 states. [2021-11-07 02:29:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10166 to 5225. [2021-11-07 02:29:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5225 states, 5153 states have (on average 2.017659615757811) internal successors, (10397), 5224 states have internal predecessors, (10397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 10397 transitions. [2021-11-07 02:29:44,461 INFO L78 Accepts]: Start accepts. Automaton has 5225 states and 10397 transitions. Word has length 24 [2021-11-07 02:29:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:44,462 INFO L470 AbstractCegarLoop]: Abstraction has 5225 states and 10397 transitions. [2021-11-07 02:29:44,462 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 02:29:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5225 states and 10397 transitions. [2021-11-07 02:29:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:44,462 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:44,462 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 02:29:44,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-11-07 02:29:44,463 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1427542376, now seen corresponding path program 16 times [2021-11-07 02:29:44,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:44,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079634293] [2021-11-07 02:29:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:44,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:44,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 02:29:44,855 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:44,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079634293] [2021-11-07 02:29:44,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079634293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:44,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:44,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:44,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465579324] [2021-11-07 02:29:44,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:44,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:44,856 INFO L87 Difference]: Start difference. First operand 5225 states and 10397 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 02:29:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:47,173 INFO L93 Difference]: Finished difference Result 14386 states and 28508 transitions. [2021-11-07 02:29:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:29:47,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 02:29:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:47,190 INFO L225 Difference]: With dead ends: 14386 [2021-11-07 02:29:47,190 INFO L226 Difference]: Without dead ends: 14386 [2021-11-07 02:29:47,191 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:29:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14386 states. [2021-11-07 02:29:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14386 to 5244. [2021-11-07 02:29:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 5172 states have (on average 2.0175947409126063) internal successors, (10435), 5243 states have internal predecessors, (10435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 10435 transitions. [2021-11-07 02:29:47,290 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 10435 transitions. Word has length 24 [2021-11-07 02:29:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:47,290 INFO L470 AbstractCegarLoop]: Abstraction has 5244 states and 10435 transitions. [2021-11-07 02:29:47,290 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 02:29:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 10435 transitions. [2021-11-07 02:29:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:47,291 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:47,291 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 02:29:47,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-11-07 02:29:47,291 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -790412898, now seen corresponding path program 17 times [2021-11-07 02:29:47,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:47,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233587840] [2021-11-07 02:29:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:47,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:47,664 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 02:29:47,664 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:47,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233587840] [2021-11-07 02:29:47,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233587840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:47,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:47,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:47,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100565779] [2021-11-07 02:29:47,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:47,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:47,665 INFO L87 Difference]: Start difference. First operand 5244 states and 10435 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 02:29:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:50,505 INFO L93 Difference]: Finished difference Result 14397 states and 28530 transitions. [2021-11-07 02:29:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:29:50,505 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 02:29:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:50,522 INFO L225 Difference]: With dead ends: 14397 [2021-11-07 02:29:50,522 INFO L226 Difference]: Without dead ends: 14397 [2021-11-07 02:29:50,522 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:29:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14397 states. [2021-11-07 02:29:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14397 to 5231. [2021-11-07 02:29:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5159 states have (on average 2.01763907734057) internal successors, (10409), 5230 states have internal predecessors, (10409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 10409 transitions. [2021-11-07 02:29:50,621 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 10409 transitions. Word has length 24 [2021-11-07 02:29:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:50,621 INFO L470 AbstractCegarLoop]: Abstraction has 5231 states and 10409 transitions. [2021-11-07 02:29:50,622 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 02:29:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 10409 transitions. [2021-11-07 02:29:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:50,622 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:50,622 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 02:29:50,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-11-07 02:29:50,623 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1534096784, now seen corresponding path program 18 times [2021-11-07 02:29:50,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:50,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807721223] [2021-11-07 02:29:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:50,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:50,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 02:29:50,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:50,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807721223] [2021-11-07 02:29:50,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807721223] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:50,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:50,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:50,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142010539] [2021-11-07 02:29:50,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:50,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:50,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:50,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:50,927 INFO L87 Difference]: Start difference. First operand 5231 states and 10409 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 02:29:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:53,413 INFO L93 Difference]: Finished difference Result 14422 states and 28580 transitions. [2021-11-07 02:29:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:29:53,413 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 02:29:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:53,428 INFO L225 Difference]: With dead ends: 14422 [2021-11-07 02:29:53,428 INFO L226 Difference]: Without dead ends: 14422 [2021-11-07 02:29:53,429 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:29:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14422 states. [2021-11-07 02:29:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14422 to 5218. [2021-11-07 02:29:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5218 states, 5146 states have (on average 2.0176836377769143) internal successors, (10383), 5217 states have internal predecessors, (10383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 10383 transitions. [2021-11-07 02:29:53,521 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 10383 transitions. Word has length 24 [2021-11-07 02:29:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:53,521 INFO L470 AbstractCegarLoop]: Abstraction has 5218 states and 10383 transitions. [2021-11-07 02:29:53,521 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 02:29:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 10383 transitions. [2021-11-07 02:29:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:53,522 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:53,522 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 02:29:53,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-11-07 02:29:53,522 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:53,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 151574242, now seen corresponding path program 19 times [2021-11-07 02:29:53,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:53,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625161870] [2021-11-07 02:29:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:53,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:53,774 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 02:29:53,774 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:53,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625161870] [2021-11-07 02:29:53,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625161870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:53,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:53,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:29:53,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131913259] [2021-11-07 02:29:53,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:29:53,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:53,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:29:53,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:29:53,775 INFO L87 Difference]: Start difference. First operand 5218 states and 10383 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 02:29:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:29:56,898 INFO L93 Difference]: Finished difference Result 14501 states and 28734 transitions. [2021-11-07 02:29:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:29:56,899 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 02:29:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:29:56,916 INFO L225 Difference]: With dead ends: 14501 [2021-11-07 02:29:56,916 INFO L226 Difference]: Without dead ends: 14501 [2021-11-07 02:29:56,916 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:29:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14501 states. [2021-11-07 02:29:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14501 to 5195. [2021-11-07 02:29:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5195 states, 5123 states have (on average 2.017763029474917) internal successors, (10337), 5194 states have internal predecessors, (10337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:29:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 10337 transitions. [2021-11-07 02:29:57,015 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 10337 transitions. Word has length 24 [2021-11-07 02:29:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:29:57,015 INFO L470 AbstractCegarLoop]: Abstraction has 5195 states and 10337 transitions. [2021-11-07 02:29:57,015 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 02:29:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 10337 transitions. [2021-11-07 02:29:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:29:57,016 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:29:57,016 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 02:29:57,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-11-07 02:29:57,016 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:29:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:29:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 274148579, now seen corresponding path program 52 times [2021-11-07 02:29:57,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:29:57,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884814285] [2021-11-07 02:29:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:29:57,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:29:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:29:57,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 02:29:57,321 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:29:57,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884814285] [2021-11-07 02:29:57,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884814285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:29:57,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:29:57,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:29:57,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056057713] [2021-11-07 02:29:57,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:29:57,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:29:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:29:57,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:29:57,322 INFO L87 Difference]: Start difference. First operand 5195 states and 10337 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:00,260 INFO L93 Difference]: Finished difference Result 9700 states and 19269 transitions. [2021-11-07 02:30:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:30:00,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:00,270 INFO L225 Difference]: With dead ends: 9700 [2021-11-07 02:30:00,270 INFO L226 Difference]: Without dead ends: 9700 [2021-11-07 02:30:00,271 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:30:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2021-11-07 02:30:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 5188. [2021-11-07 02:30:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 5116 states have (on average 2.017787333854574) internal successors, (10323), 5187 states have internal predecessors, (10323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 10323 transitions. [2021-11-07 02:30:00,344 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 10323 transitions. Word has length 24 [2021-11-07 02:30:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:00,344 INFO L470 AbstractCegarLoop]: Abstraction has 5188 states and 10323 transitions. [2021-11-07 02:30:00,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 10323 transitions. [2021-11-07 02:30:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:00,345 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:00,345 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 02:30:00,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-11-07 02:30:00,345 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash 482431739, now seen corresponding path program 53 times [2021-11-07 02:30:00,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:00,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592419696] [2021-11-07 02:30:00,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:00,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:00,632 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 02:30:00,633 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:00,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592419696] [2021-11-07 02:30:00,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592419696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:00,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:00,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:00,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782770187] [2021-11-07 02:30:00,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:00,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:00,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:00,634 INFO L87 Difference]: Start difference. First operand 5188 states and 10323 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:04,035 INFO L93 Difference]: Finished difference Result 9704 states and 19277 transitions. [2021-11-07 02:30:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:30:04,035 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:04,044 INFO L225 Difference]: With dead ends: 9704 [2021-11-07 02:30:04,044 INFO L226 Difference]: Without dead ends: 9704 [2021-11-07 02:30:04,044 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:30:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2021-11-07 02:30:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 5189. [2021-11-07 02:30:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 5117 states have (on average 2.017783857729138) internal successors, (10325), 5188 states have internal predecessors, (10325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 10325 transitions. [2021-11-07 02:30:04,115 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 10325 transitions. Word has length 24 [2021-11-07 02:30:04,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:04,115 INFO L470 AbstractCegarLoop]: Abstraction has 5189 states and 10325 transitions. [2021-11-07 02:30:04,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 10325 transitions. [2021-11-07 02:30:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:04,116 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:04,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 02:30:04,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-11-07 02:30:04,116 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash 487127309, now seen corresponding path program 54 times [2021-11-07 02:30:04,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:04,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967589065] [2021-11-07 02:30:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:04,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:04,387 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 02:30:04,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:04,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967589065] [2021-11-07 02:30:04,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967589065] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:04,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:04,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:04,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012138712] [2021-11-07 02:30:04,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:04,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:04,388 INFO L87 Difference]: Start difference. First operand 5189 states and 10325 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:06,872 INFO L93 Difference]: Finished difference Result 9713 states and 19295 transitions. [2021-11-07 02:30:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:30:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:06,882 INFO L225 Difference]: With dead ends: 9713 [2021-11-07 02:30:06,883 INFO L226 Difference]: Without dead ends: 9713 [2021-11-07 02:30:06,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=588, Unknown=0, NotChecked=0, Total=870 [2021-11-07 02:30:06,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9713 states. [2021-11-07 02:30:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9713 to 5181. [2021-11-07 02:30:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5109 states have (on average 2.017811704834606) internal successors, (10309), 5180 states have internal predecessors, (10309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 10309 transitions. [2021-11-07 02:30:06,956 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 10309 transitions. Word has length 24 [2021-11-07 02:30:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:06,956 INFO L470 AbstractCegarLoop]: Abstraction has 5181 states and 10309 transitions. [2021-11-07 02:30:06,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 10309 transitions. [2021-11-07 02:30:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:06,957 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:06,957 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 02:30:06,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-11-07 02:30:06,957 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash 835864419, now seen corresponding path program 55 times [2021-11-07 02:30:06,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:06,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942356594] [2021-11-07 02:30:06,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:06,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:07,204 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 02:30:07,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:07,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942356594] [2021-11-07 02:30:07,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942356594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:07,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:07,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:07,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605393091] [2021-11-07 02:30:07,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:07,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:07,206 INFO L87 Difference]: Start difference. First operand 5181 states and 10309 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:09,404 INFO L93 Difference]: Finished difference Result 9710 states and 19289 transitions. [2021-11-07 02:30:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:30:09,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:09,414 INFO L225 Difference]: With dead ends: 9710 [2021-11-07 02:30:09,414 INFO L226 Difference]: Without dead ends: 9710 [2021-11-07 02:30:09,414 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:30:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9710 states. [2021-11-07 02:30:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9710 to 5183. [2021-11-07 02:30:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 5111 states have (on average 2.017804734885541) internal successors, (10313), 5182 states have internal predecessors, (10313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 10313 transitions. [2021-11-07 02:30:09,486 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 10313 transitions. Word has length 24 [2021-11-07 02:30:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:09,486 INFO L470 AbstractCegarLoop]: Abstraction has 5183 states and 10313 transitions. [2021-11-07 02:30:09,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 10313 transitions. [2021-11-07 02:30:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:09,487 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:09,487 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 02:30:09,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-11-07 02:30:09,488 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash 840559989, now seen corresponding path program 56 times [2021-11-07 02:30:09,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:09,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425359877] [2021-11-07 02:30:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:09,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:09,717 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 02:30:09,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:09,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425359877] [2021-11-07 02:30:09,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425359877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:09,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:09,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:09,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114940690] [2021-11-07 02:30:09,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:09,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:09,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:09,718 INFO L87 Difference]: Start difference. First operand 5183 states and 10313 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:13,047 INFO L93 Difference]: Finished difference Result 9719 states and 19307 transitions. [2021-11-07 02:30:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 02:30:13,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:13,058 INFO L225 Difference]: With dead ends: 9719 [2021-11-07 02:30:13,058 INFO L226 Difference]: Without dead ends: 9719 [2021-11-07 02:30:13,058 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=632, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:30:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9719 states. [2021-11-07 02:30:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9719 to 5182. [2021-11-07 02:30:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 5110 states have (on average 2.0178082191780824) internal successors, (10311), 5181 states have internal predecessors, (10311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 10311 transitions. [2021-11-07 02:30:13,155 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 10311 transitions. Word has length 24 [2021-11-07 02:30:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:13,156 INFO L470 AbstractCegarLoop]: Abstraction has 5182 states and 10311 transitions. [2021-11-07 02:30:13,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 10311 transitions. [2021-11-07 02:30:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:13,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:13,157 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 02:30:13,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-11-07 02:30:13,157 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 987045219, now seen corresponding path program 57 times [2021-11-07 02:30:13,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:13,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722452150] [2021-11-07 02:30:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:13,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:13,386 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 02:30:13,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:13,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722452150] [2021-11-07 02:30:13,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722452150] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:13,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:13,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:13,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590182609] [2021-11-07 02:30:13,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:13,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:13,387 INFO L87 Difference]: Start difference. First operand 5182 states and 10311 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:16,256 INFO L93 Difference]: Finished difference Result 9726 states and 19321 transitions. [2021-11-07 02:30:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:30:16,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:16,267 INFO L225 Difference]: With dead ends: 9726 [2021-11-07 02:30:16,267 INFO L226 Difference]: Without dead ends: 9726 [2021-11-07 02:30:16,267 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=331, Invalid=661, Unknown=0, NotChecked=0, Total=992 [2021-11-07 02:30:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9726 states. [2021-11-07 02:30:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9726 to 5174. [2021-11-07 02:30:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5174 states, 5102 states have (on average 2.0178361426891414) internal successors, (10295), 5173 states have internal predecessors, (10295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5174 states to 5174 states and 10295 transitions. [2021-11-07 02:30:16,340 INFO L78 Accepts]: Start accepts. Automaton has 5174 states and 10295 transitions. Word has length 24 [2021-11-07 02:30:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:16,340 INFO L470 AbstractCegarLoop]: Abstraction has 5174 states and 10295 transitions. [2021-11-07 02:30:16,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5174 states and 10295 transitions. [2021-11-07 02:30:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:16,341 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:16,341 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 02:30:16,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-11-07 02:30:16,341 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1317767045, now seen corresponding path program 58 times [2021-11-07 02:30:16,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:16,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232162532] [2021-11-07 02:30:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:16,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:16,569 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 02:30:16,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:16,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232162532] [2021-11-07 02:30:16,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232162532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:16,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:16,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:16,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262498613] [2021-11-07 02:30:16,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:16,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:16,570 INFO L87 Difference]: Start difference. First operand 5174 states and 10295 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:18,646 INFO L93 Difference]: Finished difference Result 9706 states and 19281 transitions. [2021-11-07 02:30:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:30:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:18,655 INFO L225 Difference]: With dead ends: 9706 [2021-11-07 02:30:18,655 INFO L226 Difference]: Without dead ends: 9706 [2021-11-07 02:30:18,656 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:30:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2021-11-07 02:30:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5173. [2021-11-07 02:30:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5101 states have (on average 2.0178396392864144) internal successors, (10293), 5172 states have internal predecessors, (10293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 10293 transitions. [2021-11-07 02:30:18,726 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 10293 transitions. Word has length 24 [2021-11-07 02:30:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:18,726 INFO L470 AbstractCegarLoop]: Abstraction has 5173 states and 10293 transitions. [2021-11-07 02:30:18,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 10293 transitions. [2021-11-07 02:30:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:18,727 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:18,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] [2021-11-07 02:30:18,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-11-07 02:30:18,727 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1313071475, now seen corresponding path program 59 times [2021-11-07 02:30:18,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:18,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103195644] [2021-11-07 02:30:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:18,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:18,964 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 02:30:18,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:18,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103195644] [2021-11-07 02:30:18,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103195644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:18,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:18,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:18,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507548320] [2021-11-07 02:30:18,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:18,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:18,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:18,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:18,967 INFO L87 Difference]: Start difference. First operand 5173 states and 10293 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:20,773 INFO L93 Difference]: Finished difference Result 9719 states and 19307 transitions. [2021-11-07 02:30:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:30:20,774 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:20,784 INFO L225 Difference]: With dead ends: 9719 [2021-11-07 02:30:20,784 INFO L226 Difference]: Without dead ends: 9719 [2021-11-07 02:30:20,784 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:30:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9719 states. [2021-11-07 02:30:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9719 to 5172. [2021-11-07 02:30:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5172 states, 5100 states have (on average 2.017843137254902) internal successors, (10291), 5171 states have internal predecessors, (10291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 10291 transitions. [2021-11-07 02:30:20,860 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 10291 transitions. Word has length 24 [2021-11-07 02:30:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:20,861 INFO L470 AbstractCegarLoop]: Abstraction has 5172 states and 10291 transitions. [2021-11-07 02:30:20,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 10291 transitions. [2021-11-07 02:30:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:20,862 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:20,862 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 02:30:20,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-11-07 02:30:20,863 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:20,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1166586245, now seen corresponding path program 60 times [2021-11-07 02:30:20,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:20,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517137097] [2021-11-07 02:30:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:20,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:21,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 02:30:21,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:21,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517137097] [2021-11-07 02:30:21,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517137097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:21,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:21,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:21,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424398769] [2021-11-07 02:30:21,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:21,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:21,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:21,092 INFO L87 Difference]: Start difference. First operand 5172 states and 10291 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:24,546 INFO L93 Difference]: Finished difference Result 9726 states and 19321 transitions. [2021-11-07 02:30:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 02:30:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:24,556 INFO L225 Difference]: With dead ends: 9726 [2021-11-07 02:30:24,556 INFO L226 Difference]: Without dead ends: 9726 [2021-11-07 02:30:24,557 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=711, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 02:30:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9726 states. [2021-11-07 02:30:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9726 to 5171. [2021-11-07 02:30:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 5099 states have (on average 2.017846636595411) internal successors, (10289), 5170 states have internal predecessors, (10289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 10289 transitions. [2021-11-07 02:30:24,629 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 10289 transitions. Word has length 24 [2021-11-07 02:30:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:24,629 INFO L470 AbstractCegarLoop]: Abstraction has 5171 states and 10289 transitions. [2021-11-07 02:30:24,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 10289 transitions. [2021-11-07 02:30:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:24,630 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:24,630 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 02:30:24,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-11-07 02:30:24,630 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash -834713331, now seen corresponding path program 61 times [2021-11-07 02:30:24,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:24,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512754181] [2021-11-07 02:30:24,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:24,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:24,827 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 02:30:24,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:24,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512754181] [2021-11-07 02:30:24,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512754181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:24,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:24,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:30:24,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214783290] [2021-11-07 02:30:24,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:30:24,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:24,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:30:24,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:30:24,828 INFO L87 Difference]: Start difference. First operand 5171 states and 10289 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:27,669 INFO L93 Difference]: Finished difference Result 9715 states and 19295 transitions. [2021-11-07 02:30:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 02:30:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 02:30:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:27,679 INFO L225 Difference]: With dead ends: 9715 [2021-11-07 02:30:27,679 INFO L226 Difference]: Without dead ends: 9715 [2021-11-07 02:30:27,680 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=761, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 02:30:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9715 states. [2021-11-07 02:30:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9715 to 5133. [2021-11-07 02:30:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5133 states, 5061 states have (on average 2.017190278601067) internal successors, (10209), 5132 states have internal predecessors, (10209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 10209 transitions. [2021-11-07 02:30:27,799 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 10209 transitions. Word has length 24 [2021-11-07 02:30:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:27,800 INFO L470 AbstractCegarLoop]: Abstraction has 5133 states and 10209 transitions. [2021-11-07 02:30:27,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 10209 transitions. [2021-11-07 02:30:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:27,800 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:27,800 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 02:30:27,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-11-07 02:30:27,800 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash 742148859, now seen corresponding path program 7 times [2021-11-07 02:30:27,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:27,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505515466] [2021-11-07 02:30:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:27,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:27,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 02:30:27,951 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:27,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505515466] [2021-11-07 02:30:27,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505515466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:27,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:27,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:27,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916475856] [2021-11-07 02:30:27,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:27,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:27,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:27,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:27,952 INFO L87 Difference]: Start difference. First operand 5133 states and 10209 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 02:30:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:29,786 INFO L93 Difference]: Finished difference Result 12398 states and 24612 transitions. [2021-11-07 02:30:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:30:29,787 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 02:30:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:29,808 INFO L225 Difference]: With dead ends: 12398 [2021-11-07 02:30:29,808 INFO L226 Difference]: Without dead ends: 12398 [2021-11-07 02:30:29,808 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:30:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12398 states. [2021-11-07 02:30:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12398 to 5165. [2021-11-07 02:30:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5093 states have (on average 2.017867661496171) internal successors, (10277), 5164 states have internal predecessors, (10277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 10277 transitions. [2021-11-07 02:30:29,929 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 10277 transitions. Word has length 24 [2021-11-07 02:30:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:29,929 INFO L470 AbstractCegarLoop]: Abstraction has 5165 states and 10277 transitions. [2021-11-07 02:30:29,930 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 02:30:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 10277 transitions. [2021-11-07 02:30:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:29,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:29,931 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 02:30:29,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-11-07 02:30:29,931 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:29,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1016318039, now seen corresponding path program 62 times [2021-11-07 02:30:29,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:29,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240966064] [2021-11-07 02:30:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:29,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:30,059 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 02:30:30,059 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:30,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240966064] [2021-11-07 02:30:30,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240966064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:30,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:30,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:30,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913478910] [2021-11-07 02:30:30,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:30,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:30,060 INFO L87 Difference]: Start difference. First operand 5165 states and 10277 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 02:30:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:32,035 INFO L93 Difference]: Finished difference Result 12128 states and 24078 transitions. [2021-11-07 02:30:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:30:32,035 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 02:30:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:32,048 INFO L225 Difference]: With dead ends: 12128 [2021-11-07 02:30:32,048 INFO L226 Difference]: Without dead ends: 12128 [2021-11-07 02:30:32,048 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:30:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12128 states. [2021-11-07 02:30:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12128 to 5148. [2021-11-07 02:30:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5076 states have (on average 2.017927501970055) internal successors, (10243), 5147 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 10243 transitions. [2021-11-07 02:30:32,167 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 10243 transitions. Word has length 24 [2021-11-07 02:30:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:32,167 INFO L470 AbstractCegarLoop]: Abstraction has 5148 states and 10243 transitions. [2021-11-07 02:30:32,167 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 02:30:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 10243 transitions. [2021-11-07 02:30:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:32,167 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:32,168 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 02:30:32,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-11-07 02:30:32,168 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1401653191, now seen corresponding path program 63 times [2021-11-07 02:30:32,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:32,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247050501] [2021-11-07 02:30:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:32,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:32,327 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 02:30:32,327 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:32,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247050501] [2021-11-07 02:30:32,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247050501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:32,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:32,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:32,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431762946] [2021-11-07 02:30:32,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:32,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:32,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:32,328 INFO L87 Difference]: Start difference. First operand 5148 states and 10243 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 02:30:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:34,351 INFO L93 Difference]: Finished difference Result 8773 states and 17434 transitions. [2021-11-07 02:30:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:30:34,352 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 02:30:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:34,360 INFO L225 Difference]: With dead ends: 8773 [2021-11-07 02:30:34,360 INFO L226 Difference]: Without dead ends: 8773 [2021-11-07 02:30:34,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:30:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2021-11-07 02:30:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 5147. [2021-11-07 02:30:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 5075 states have (on average 2.017931034482759) internal successors, (10241), 5146 states have internal predecessors, (10241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 10241 transitions. [2021-11-07 02:30:34,428 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 10241 transitions. Word has length 24 [2021-11-07 02:30:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:34,428 INFO L470 AbstractCegarLoop]: Abstraction has 5147 states and 10241 transitions. [2021-11-07 02:30:34,429 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 02:30:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 10241 transitions. [2021-11-07 02:30:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:34,429 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:34,429 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 02:30:34,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-11-07 02:30:34,429 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1406348761, now seen corresponding path program 64 times [2021-11-07 02:30:34,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:34,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758913277] [2021-11-07 02:30:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:34,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:34,609 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 02:30:34,610 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:34,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758913277] [2021-11-07 02:30:34,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758913277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:34,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:34,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:34,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374277873] [2021-11-07 02:30:34,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:34,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:34,611 INFO L87 Difference]: Start difference. First operand 5147 states and 10241 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 02:30:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:36,325 INFO L93 Difference]: Finished difference Result 8787 states and 17462 transitions. [2021-11-07 02:30:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:30:36,326 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 02:30:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:36,334 INFO L225 Difference]: With dead ends: 8787 [2021-11-07 02:30:36,335 INFO L226 Difference]: Without dead ends: 8787 [2021-11-07 02:30:36,335 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-11-07 02:30:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8787 states. [2021-11-07 02:30:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8787 to 5146. [2021-11-07 02:30:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5074 states have (on average 2.01793456838786) internal successors, (10239), 5145 states have internal predecessors, (10239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 10239 transitions. [2021-11-07 02:30:36,402 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 10239 transitions. Word has length 24 [2021-11-07 02:30:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:36,402 INFO L470 AbstractCegarLoop]: Abstraction has 5146 states and 10239 transitions. [2021-11-07 02:30:36,403 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 02:30:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 10239 transitions. [2021-11-07 02:30:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:36,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:36,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 02:30:36,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-11-07 02:30:36,403 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1552833991, now seen corresponding path program 65 times [2021-11-07 02:30:36,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:36,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717174678] [2021-11-07 02:30:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:36,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:36,582 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 02:30:36,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:36,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717174678] [2021-11-07 02:30:36,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717174678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:36,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:36,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:36,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135320237] [2021-11-07 02:30:36,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:36,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:36,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:36,583 INFO L87 Difference]: Start difference. First operand 5146 states and 10239 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 02:30:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:38,079 INFO L93 Difference]: Finished difference Result 8801 states and 17490 transitions. [2021-11-07 02:30:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:30:38,080 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 02:30:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:38,088 INFO L225 Difference]: With dead ends: 8801 [2021-11-07 02:30:38,089 INFO L226 Difference]: Without dead ends: 8801 [2021-11-07 02:30:38,089 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:30:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8801 states. [2021-11-07 02:30:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8801 to 5145. [2021-11-07 02:30:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5145 states, 5073 states have (on average 2.017938103686182) internal successors, (10237), 5144 states have internal predecessors, (10237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 10237 transitions. [2021-11-07 02:30:38,156 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 10237 transitions. Word has length 24 [2021-11-07 02:30:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:38,157 INFO L470 AbstractCegarLoop]: Abstraction has 5145 states and 10237 transitions. [2021-11-07 02:30:38,157 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 02:30:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 10237 transitions. [2021-11-07 02:30:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:38,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:38,157 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 02:30:38,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-11-07 02:30:38,158 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1884706905, now seen corresponding path program 66 times [2021-11-07 02:30:38,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:38,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480063498] [2021-11-07 02:30:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:38,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:38,299 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 02:30:38,299 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:38,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480063498] [2021-11-07 02:30:38,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480063498] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:38,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:38,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:38,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305926051] [2021-11-07 02:30:38,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:38,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:38,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:38,300 INFO L87 Difference]: Start difference. First operand 5145 states and 10237 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 02:30:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:40,843 INFO L93 Difference]: Finished difference Result 8795 states and 17474 transitions. [2021-11-07 02:30:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:30:40,843 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 02:30:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:40,852 INFO L225 Difference]: With dead ends: 8795 [2021-11-07 02:30:40,852 INFO L226 Difference]: Without dead ends: 8795 [2021-11-07 02:30:40,852 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:30:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8795 states. [2021-11-07 02:30:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8795 to 5123. [2021-11-07 02:30:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5123 states, 5051 states have (on average 2.0172243120174222) internal successors, (10189), 5122 states have internal predecessors, (10189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5123 states to 5123 states and 10189 transitions. [2021-11-07 02:30:40,925 INFO L78 Accepts]: Start accepts. Automaton has 5123 states and 10189 transitions. Word has length 24 [2021-11-07 02:30:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:40,925 INFO L470 AbstractCegarLoop]: Abstraction has 5123 states and 10189 transitions. [2021-11-07 02:30:40,925 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 02:30:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5123 states and 10189 transitions. [2021-11-07 02:30:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:40,926 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:40,926 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 02:30:40,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-11-07 02:30:40,926 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1662866573, now seen corresponding path program 8 times [2021-11-07 02:30:40,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:40,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160455384] [2021-11-07 02:30:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:40,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:41,068 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 02:30:41,068 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:41,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160455384] [2021-11-07 02:30:41,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160455384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:41,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:41,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:41,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100602750] [2021-11-07 02:30:41,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:41,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:41,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:41,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:41,069 INFO L87 Difference]: Start difference. First operand 5123 states and 10189 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 02:30:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:42,579 INFO L93 Difference]: Finished difference Result 13012 states and 25849 transitions. [2021-11-07 02:30:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:30:42,579 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 02:30:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:42,594 INFO L225 Difference]: With dead ends: 13012 [2021-11-07 02:30:42,594 INFO L226 Difference]: Without dead ends: 13012 [2021-11-07 02:30:42,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:30:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13012 states. [2021-11-07 02:30:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13012 to 5153. [2021-11-07 02:30:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5153 states, 5081 states have (on average 2.0177130486124777) internal successors, (10252), 5152 states have internal predecessors, (10252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 10252 transitions. [2021-11-07 02:30:42,685 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 10252 transitions. Word has length 24 [2021-11-07 02:30:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:42,685 INFO L470 AbstractCegarLoop]: Abstraction has 5153 states and 10252 transitions. [2021-11-07 02:30:42,685 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 02:30:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 10252 transitions. [2021-11-07 02:30:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:42,686 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:42,686 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 02:30:42,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-11-07 02:30:42,686 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1106507135, now seen corresponding path program 9 times [2021-11-07 02:30:42,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:42,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548935907] [2021-11-07 02:30:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:42,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:42,832 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 02:30:42,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:42,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548935907] [2021-11-07 02:30:42,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548935907] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:42,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:42,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:42,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658071990] [2021-11-07 02:30:42,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:42,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:42,833 INFO L87 Difference]: Start difference. First operand 5153 states and 10252 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 02:30:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:44,607 INFO L93 Difference]: Finished difference Result 12983 states and 25791 transitions. [2021-11-07 02:30:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:30:44,608 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 02:30:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:44,623 INFO L225 Difference]: With dead ends: 12983 [2021-11-07 02:30:44,623 INFO L226 Difference]: Without dead ends: 12983 [2021-11-07 02:30:44,623 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:30:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2021-11-07 02:30:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 5154. [2021-11-07 02:30:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5082 states have (on average 2.0177095631641087) internal successors, (10254), 5153 states have internal predecessors, (10254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 10254 transitions. [2021-11-07 02:30:44,715 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 10254 transitions. Word has length 24 [2021-11-07 02:30:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:44,715 INFO L470 AbstractCegarLoop]: Abstraction has 5154 states and 10254 transitions. [2021-11-07 02:30:44,715 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 02:30:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 10254 transitions. [2021-11-07 02:30:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:44,716 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:44,716 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 02:30:44,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-11-07 02:30:44,716 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1357645265, now seen corresponding path program 10 times [2021-11-07 02:30:44,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:44,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489976036] [2021-11-07 02:30:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:44,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:44,876 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 02:30:44,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:44,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489976036] [2021-11-07 02:30:44,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489976036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:44,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:44,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:44,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25994982] [2021-11-07 02:30:44,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:44,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:44,877 INFO L87 Difference]: Start difference. First operand 5154 states and 10254 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 02:30:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:46,751 INFO L93 Difference]: Finished difference Result 12874 states and 25573 transitions. [2021-11-07 02:30:46,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:30:46,752 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 02:30:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:46,767 INFO L225 Difference]: With dead ends: 12874 [2021-11-07 02:30:46,767 INFO L226 Difference]: Without dead ends: 12874 [2021-11-07 02:30:46,767 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:30:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12874 states. [2021-11-07 02:30:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12874 to 5156. [2021-11-07 02:30:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 5084 states have (on average 2.0177025963808024) internal successors, (10258), 5155 states have internal predecessors, (10258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 10258 transitions. [2021-11-07 02:30:46,857 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 10258 transitions. Word has length 24 [2021-11-07 02:30:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:46,857 INFO L470 AbstractCegarLoop]: Abstraction has 5156 states and 10258 transitions. [2021-11-07 02:30:46,858 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 02:30:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 10258 transitions. [2021-11-07 02:30:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:46,858 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:46,858 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 02:30:46,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-11-07 02:30:46,859 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1634323565, now seen corresponding path program 11 times [2021-11-07 02:30:46,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:46,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808683140] [2021-11-07 02:30:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:46,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:47,040 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 02:30:47,040 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:47,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808683140] [2021-11-07 02:30:47,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808683140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:47,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:47,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:47,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893080058] [2021-11-07 02:30:47,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:47,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:47,042 INFO L87 Difference]: Start difference. First operand 5156 states and 10258 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 02:30:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:49,065 INFO L93 Difference]: Finished difference Result 16135 states and 32031 transitions. [2021-11-07 02:30:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:30:49,065 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 02:30:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:49,084 INFO L225 Difference]: With dead ends: 16135 [2021-11-07 02:30:49,085 INFO L226 Difference]: Without dead ends: 16135 [2021-11-07 02:30:49,085 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:30:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2021-11-07 02:30:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 5165. [2021-11-07 02:30:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5093 states have (on average 2.017867661496171) internal successors, (10277), 5164 states have internal predecessors, (10277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 10277 transitions. [2021-11-07 02:30:49,192 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 10277 transitions. Word has length 24 [2021-11-07 02:30:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:49,192 INFO L470 AbstractCegarLoop]: Abstraction has 5165 states and 10277 transitions. [2021-11-07 02:30:49,192 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 02:30:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 10277 transitions. [2021-11-07 02:30:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:49,193 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:49,193 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 02:30:49,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-11-07 02:30:49,193 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1908492745, now seen corresponding path program 67 times [2021-11-07 02:30:49,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:49,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971979368] [2021-11-07 02:30:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:49,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:49,328 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 02:30:49,328 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:49,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971979368] [2021-11-07 02:30:49,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971979368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:49,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:49,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:49,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506610617] [2021-11-07 02:30:49,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:49,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:49,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:49,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:49,329 INFO L87 Difference]: Start difference. First operand 5165 states and 10277 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 02:30:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:51,426 INFO L93 Difference]: Finished difference Result 15615 states and 30999 transitions. [2021-11-07 02:30:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:30:51,427 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 02:30:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:51,445 INFO L225 Difference]: With dead ends: 15615 [2021-11-07 02:30:51,445 INFO L226 Difference]: Without dead ends: 15615 [2021-11-07 02:30:51,445 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:30:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15615 states. [2021-11-07 02:30:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15615 to 5122. [2021-11-07 02:30:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5122 states, 5050 states have (on average 2.0172277227722772) internal successors, (10187), 5121 states have internal predecessors, (10187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 10187 transitions. [2021-11-07 02:30:51,550 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 10187 transitions. Word has length 24 [2021-11-07 02:30:51,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:51,550 INFO L470 AbstractCegarLoop]: Abstraction has 5122 states and 10187 transitions. [2021-11-07 02:30:51,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 02:30:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 10187 transitions. [2021-11-07 02:30:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:51,551 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:51,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 02:30:51,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-11-07 02:30:51,551 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1404950971, now seen corresponding path program 12 times [2021-11-07 02:30:51,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:51,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282590699] [2021-11-07 02:30:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:51,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:51,700 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 02:30:51,700 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:51,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282590699] [2021-11-07 02:30:51,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282590699] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:51,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:51,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:51,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003250227] [2021-11-07 02:30:51,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:51,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:51,701 INFO L87 Difference]: Start difference. First operand 5122 states and 10187 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 02:30:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:53,520 INFO L93 Difference]: Finished difference Result 5600 states and 11141 transitions. [2021-11-07 02:30:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:30:53,520 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 02:30:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:53,526 INFO L225 Difference]: With dead ends: 5600 [2021-11-07 02:30:53,526 INFO L226 Difference]: Without dead ends: 5600 [2021-11-07 02:30:53,526 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:30:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2021-11-07 02:30:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 5151. [2021-11-07 02:30:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5151 states, 5079 states have (on average 2.017720023626698) internal successors, (10248), 5150 states have internal predecessors, (10248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5151 states to 5151 states and 10248 transitions. [2021-11-07 02:30:53,579 INFO L78 Accepts]: Start accepts. Automaton has 5151 states and 10248 transitions. Word has length 24 [2021-11-07 02:30:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:53,579 INFO L470 AbstractCegarLoop]: Abstraction has 5151 states and 10248 transitions. [2021-11-07 02:30:53,579 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 02:30:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5151 states and 10248 transitions. [2021-11-07 02:30:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:53,580 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:53,580 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 02:30:53,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-11-07 02:30:53,580 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1364422737, now seen corresponding path program 13 times [2021-11-07 02:30:53,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:53,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965754079] [2021-11-07 02:30:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:53,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:53,761 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 02:30:53,761 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:53,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965754079] [2021-11-07 02:30:53,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965754079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:53,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:53,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:53,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950583013] [2021-11-07 02:30:53,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:53,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:53,762 INFO L87 Difference]: Start difference. First operand 5151 states and 10248 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 02:30:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:55,252 INFO L93 Difference]: Finished difference Result 5579 states and 11099 transitions. [2021-11-07 02:30:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:30:55,252 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 02:30:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:55,258 INFO L225 Difference]: With dead ends: 5579 [2021-11-07 02:30:55,258 INFO L226 Difference]: Without dead ends: 5579 [2021-11-07 02:30:55,258 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:30:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2021-11-07 02:30:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 5152. [2021-11-07 02:30:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5152 states, 5080 states have (on average 2.017716535433071) internal successors, (10250), 5151 states have internal predecessors, (10250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5152 states to 5152 states and 10250 transitions. [2021-11-07 02:30:55,310 INFO L78 Accepts]: Start accepts. Automaton has 5152 states and 10250 transitions. Word has length 24 [2021-11-07 02:30:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:55,311 INFO L470 AbstractCegarLoop]: Abstraction has 5152 states and 10250 transitions. [2021-11-07 02:30:55,311 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 02:30:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5152 states and 10250 transitions. [2021-11-07 02:30:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:55,311 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:55,312 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 02:30:55,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-11-07 02:30:55,312 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1615560867, now seen corresponding path program 14 times [2021-11-07 02:30:55,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:55,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303162509] [2021-11-07 02:30:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:55,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:55,517 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 02:30:55,517 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:55,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303162509] [2021-11-07 02:30:55,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303162509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:55,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:55,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:55,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027602188] [2021-11-07 02:30:55,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:55,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:55,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:55,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:55,518 INFO L87 Difference]: Start difference. First operand 5152 states and 10250 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 02:30:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:57,210 INFO L93 Difference]: Finished difference Result 5470 states and 10881 transitions. [2021-11-07 02:30:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:30:57,211 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 02:30:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:57,216 INFO L225 Difference]: With dead ends: 5470 [2021-11-07 02:30:57,216 INFO L226 Difference]: Without dead ends: 5470 [2021-11-07 02:30:57,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:30:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5470 states. [2021-11-07 02:30:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5470 to 5154. [2021-11-07 02:30:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5082 states have (on average 2.0177095631641087) internal successors, (10254), 5153 states have internal predecessors, (10254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 10254 transitions. [2021-11-07 02:30:57,269 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 10254 transitions. Word has length 24 [2021-11-07 02:30:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:57,269 INFO L470 AbstractCegarLoop]: Abstraction has 5154 states and 10254 transitions. [2021-11-07 02:30:57,269 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 02:30:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 10254 transitions. [2021-11-07 02:30:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:57,269 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:57,269 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 02:30:57,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-11-07 02:30:57,270 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 404465879, now seen corresponding path program 15 times [2021-11-07 02:30:57,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:57,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414674440] [2021-11-07 02:30:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:57,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:57,458 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 02:30:57,458 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:57,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414674440] [2021-11-07 02:30:57,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414674440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:57,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:57,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:57,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160398939] [2021-11-07 02:30:57,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:57,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:57,461 INFO L87 Difference]: Start difference. First operand 5154 states and 10254 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 02:30:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:30:59,048 INFO L93 Difference]: Finished difference Result 5574 states and 11089 transitions. [2021-11-07 02:30:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:30:59,049 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 02:30:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:30:59,054 INFO L225 Difference]: With dead ends: 5574 [2021-11-07 02:30:59,054 INFO L226 Difference]: Without dead ends: 5574 [2021-11-07 02:30:59,054 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:30:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5574 states. [2021-11-07 02:30:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5574 to 5155. [2021-11-07 02:30:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5083 states have (on average 2.0177060790871533) internal successors, (10256), 5154 states have internal predecessors, (10256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:30:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 10256 transitions. [2021-11-07 02:30:59,166 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 10256 transitions. Word has length 24 [2021-11-07 02:30:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:30:59,167 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 10256 transitions. [2021-11-07 02:30:59,167 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 02:30:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 10256 transitions. [2021-11-07 02:30:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:30:59,167 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:30:59,168 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 02:30:59,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-11-07 02:30:59,168 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:30:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:30:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash 153327749, now seen corresponding path program 16 times [2021-11-07 02:30:59,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:30:59,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449900070] [2021-11-07 02:30:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:30:59,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:30:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:30:59,327 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 02:30:59,327 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:30:59,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449900070] [2021-11-07 02:30:59,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449900070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:30:59,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:30:59,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:30:59,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526693890] [2021-11-07 02:30:59,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:30:59,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:30:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:30:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:30:59,328 INFO L87 Difference]: Start difference. First operand 5155 states and 10256 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 02:31:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:00,959 INFO L93 Difference]: Finished difference Result 5474 states and 10889 transitions. [2021-11-07 02:31:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:31:00,959 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 02:31:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:00,965 INFO L225 Difference]: With dead ends: 5474 [2021-11-07 02:31:00,965 INFO L226 Difference]: Without dead ends: 5474 [2021-11-07 02:31:00,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:31:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2021-11-07 02:31:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 5154. [2021-11-07 02:31:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5082 states have (on average 2.0177095631641087) internal successors, (10254), 5153 states have internal predecessors, (10254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 10254 transitions. [2021-11-07 02:31:01,017 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 10254 transitions. Word has length 24 [2021-11-07 02:31:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:01,017 INFO L470 AbstractCegarLoop]: Abstraction has 5154 states and 10254 transitions. [2021-11-07 02:31:01,017 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 02:31:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 10254 transitions. [2021-11-07 02:31:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:01,018 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:01,018 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 02:31:01,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-11-07 02:31:01,018 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash 459278971, now seen corresponding path program 17 times [2021-11-07 02:31:01,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:01,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141059069] [2021-11-07 02:31:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:01,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:01,197 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 02:31:01,197 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:01,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141059069] [2021-11-07 02:31:01,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141059069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:01,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:01,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:31:01,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975656166] [2021-11-07 02:31:01,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:31:01,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:01,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:31:01,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:31:01,198 INFO L87 Difference]: Start difference. First operand 5154 states and 10254 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 02:31:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:02,966 INFO L93 Difference]: Finished difference Result 5464 states and 10869 transitions. [2021-11-07 02:31:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:31:02,967 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 02:31:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:02,972 INFO L225 Difference]: With dead ends: 5464 [2021-11-07 02:31:02,972 INFO L226 Difference]: Without dead ends: 5464 [2021-11-07 02:31:02,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:31:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2021-11-07 02:31:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 5154. [2021-11-07 02:31:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5082 states have (on average 2.0177095631641087) internal successors, (10254), 5153 states have internal predecessors, (10254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 10254 transitions. [2021-11-07 02:31:03,024 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 10254 transitions. Word has length 24 [2021-11-07 02:31:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:03,024 INFO L470 AbstractCegarLoop]: Abstraction has 5154 states and 10254 transitions. [2021-11-07 02:31:03,025 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 02:31:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 10254 transitions. [2021-11-07 02:31:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:03,025 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:03,025 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 02:31:03,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-11-07 02:31:03,025 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:03,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:03,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1264231689, now seen corresponding path program 18 times [2021-11-07 02:31:03,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:03,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190467431] [2021-11-07 02:31:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:03,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:03,171 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 02:31:03,171 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:03,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190467431] [2021-11-07 02:31:03,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190467431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:03,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:03,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:31:03,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334771524] [2021-11-07 02:31:03,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:31:03,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:03,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:31:03,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:31:03,172 INFO L87 Difference]: Start difference. First operand 5154 states and 10254 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 02:31:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:04,871 INFO L93 Difference]: Finished difference Result 9119 states and 18114 transitions. [2021-11-07 02:31:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:31:04,872 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 02:31:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:04,881 INFO L225 Difference]: With dead ends: 9119 [2021-11-07 02:31:04,881 INFO L226 Difference]: Without dead ends: 9119 [2021-11-07 02:31:04,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:31:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9119 states. [2021-11-07 02:31:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9119 to 5154. [2021-11-07 02:31:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5082 states have (on average 2.0177095631641087) internal successors, (10254), 5153 states have internal predecessors, (10254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 10254 transitions. [2021-11-07 02:31:04,949 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 10254 transitions. Word has length 24 [2021-11-07 02:31:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:04,949 INFO L470 AbstractCegarLoop]: Abstraction has 5154 states and 10254 transitions. [2021-11-07 02:31:04,949 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 02:31:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 10254 transitions. [2021-11-07 02:31:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:04,950 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:04,950 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 02:31:04,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-11-07 02:31:04,950 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 261361899, now seen corresponding path program 19 times [2021-11-07 02:31:04,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:04,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416361681] [2021-11-07 02:31:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:04,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:05,100 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 02:31:05,100 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:05,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416361681] [2021-11-07 02:31:05,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416361681] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:05,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:05,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:31:05,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233963757] [2021-11-07 02:31:05,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:31:05,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:05,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:31:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:31:05,101 INFO L87 Difference]: Start difference. First operand 5154 states and 10254 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 02:31:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:06,695 INFO L93 Difference]: Finished difference Result 9063 states and 18002 transitions. [2021-11-07 02:31:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:31:06,696 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 02:31:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:06,705 INFO L225 Difference]: With dead ends: 9063 [2021-11-07 02:31:06,705 INFO L226 Difference]: Without dead ends: 9063 [2021-11-07 02:31:06,706 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:31:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2021-11-07 02:31:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 5154. [2021-11-07 02:31:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5082 states have (on average 2.0177095631641087) internal successors, (10254), 5153 states have internal predecessors, (10254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 10254 transitions. [2021-11-07 02:31:06,775 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 10254 transitions. Word has length 24 [2021-11-07 02:31:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:06,775 INFO L470 AbstractCegarLoop]: Abstraction has 5154 states and 10254 transitions. [2021-11-07 02:31:06,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 02:31:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 10254 transitions. [2021-11-07 02:31:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:06,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:06,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 02:31:06,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-11-07 02:31:06,776 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash 10223769, now seen corresponding path program 20 times [2021-11-07 02:31:06,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:06,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204219815] [2021-11-07 02:31:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:06,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:06,947 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 02:31:06,947 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:06,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204219815] [2021-11-07 02:31:06,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204219815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:06,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:06,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:31:06,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322798771] [2021-11-07 02:31:06,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:31:06,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:06,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:31:06,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:31:06,948 INFO L87 Difference]: Start difference. First operand 5154 states and 10254 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 02:31:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:08,724 INFO L93 Difference]: Finished difference Result 8954 states and 17784 transitions. [2021-11-07 02:31:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:31:08,725 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 02:31:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:08,732 INFO L225 Difference]: With dead ends: 8954 [2021-11-07 02:31:08,733 INFO L226 Difference]: Without dead ends: 8954 [2021-11-07 02:31:08,733 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:31:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8954 states. [2021-11-07 02:31:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8954 to 5150. [2021-11-07 02:31:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5150 states, 5078 states have (on average 2.017723513194171) internal successors, (10246), 5149 states have internal predecessors, (10246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 10246 transitions. [2021-11-07 02:31:08,797 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 10246 transitions. Word has length 24 [2021-11-07 02:31:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:08,797 INFO L470 AbstractCegarLoop]: Abstraction has 5150 states and 10246 transitions. [2021-11-07 02:31:08,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 02:31:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 10246 transitions. [2021-11-07 02:31:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:08,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:08,798 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 02:31:08,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-11-07 02:31:08,798 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1292774697, now seen corresponding path program 21 times [2021-11-07 02:31:08,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:08,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882472833] [2021-11-07 02:31:08,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:08,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:08,937 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 02:31:08,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:08,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882472833] [2021-11-07 02:31:08,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882472833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:08,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:08,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:31:08,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800830688] [2021-11-07 02:31:08,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:31:08,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:31:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:31:08,938 INFO L87 Difference]: Start difference. First operand 5150 states and 10246 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 02:31:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:10,336 INFO L93 Difference]: Finished difference Result 8753 states and 17382 transitions. [2021-11-07 02:31:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:31:10,336 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 02:31:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:10,345 INFO L225 Difference]: With dead ends: 8753 [2021-11-07 02:31:10,345 INFO L226 Difference]: Without dead ends: 8753 [2021-11-07 02:31:10,345 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:31:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2021-11-07 02:31:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 4966. [2021-11-07 02:31:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4966 states, 4896 states have (on average 2.016952614379085) internal successors, (9875), 4965 states have internal predecessors, (9875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4966 states to 4966 states and 9875 transitions. [2021-11-07 02:31:10,412 INFO L78 Accepts]: Start accepts. Automaton has 4966 states and 9875 transitions. Word has length 24 [2021-11-07 02:31:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:10,412 INFO L470 AbstractCegarLoop]: Abstraction has 4966 states and 9875 transitions. [2021-11-07 02:31:10,412 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 02:31:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4966 states and 9875 transitions. [2021-11-07 02:31:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:10,412 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:10,413 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 02:31:10,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-11-07 02:31:10,413 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1018605517, now seen corresponding path program 68 times [2021-11-07 02:31:10,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:10,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818868158] [2021-11-07 02:31:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:10,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:10,539 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 02:31:10,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:10,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818868158] [2021-11-07 02:31:10,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818868158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:10,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:10,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:31:10,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524463746] [2021-11-07 02:31:10,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:31:10,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:31:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:31:10,540 INFO L87 Difference]: Start difference. First operand 4966 states and 9875 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 02:31:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:11,727 INFO L93 Difference]: Finished difference Result 8453 states and 16786 transitions. [2021-11-07 02:31:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:31:11,727 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 02:31:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:11,735 INFO L225 Difference]: With dead ends: 8453 [2021-11-07 02:31:11,735 INFO L226 Difference]: Without dead ends: 8453 [2021-11-07 02:31:11,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:31:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8453 states. [2021-11-07 02:31:11,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8453 to 4864. [2021-11-07 02:31:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4864 states, 4794 states have (on average 2.0160617438464747) internal successors, (9665), 4863 states have internal predecessors, (9665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4864 states to 4864 states and 9665 transitions. [2021-11-07 02:31:11,800 INFO L78 Accepts]: Start accepts. Automaton has 4864 states and 9665 transitions. Word has length 24 [2021-11-07 02:31:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:11,800 INFO L470 AbstractCegarLoop]: Abstraction has 4864 states and 9665 transitions. [2021-11-07 02:31:11,800 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 02:31:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4864 states and 9665 transitions. [2021-11-07 02:31:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:11,800 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:11,801 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 02:31:11,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-11-07 02:31:11,801 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1816181638, now seen corresponding path program 20 times [2021-11-07 02:31:11,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:11,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388566796] [2021-11-07 02:31:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:11,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:12,227 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 02:31:12,227 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:12,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388566796] [2021-11-07 02:31:12,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388566796] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:12,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:12,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:12,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382735674] [2021-11-07 02:31:12,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:12,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:12,228 INFO L87 Difference]: Start difference. First operand 4864 states and 9665 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 02:31:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:14,577 INFO L93 Difference]: Finished difference Result 5196 states and 10324 transitions. [2021-11-07 02:31:14,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:31:14,577 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 02:31:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:14,582 INFO L225 Difference]: With dead ends: 5196 [2021-11-07 02:31:14,582 INFO L226 Difference]: Without dead ends: 5196 [2021-11-07 02:31:14,582 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=308, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:31:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2021-11-07 02:31:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 4873. [2021-11-07 02:31:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4803 states have (on average 2.0160316468873622) internal successors, (9683), 4872 states have internal predecessors, (9683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 9683 transitions. [2021-11-07 02:31:14,631 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 9683 transitions. Word has length 24 [2021-11-07 02:31:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:14,631 INFO L470 AbstractCegarLoop]: Abstraction has 4873 states and 9683 transitions. [2021-11-07 02:31:14,632 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 02:31:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 9683 transitions. [2021-11-07 02:31:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:14,632 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:14,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] [2021-11-07 02:31:14,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-11-07 02:31:14,632 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash -200030698, now seen corresponding path program 21 times [2021-11-07 02:31:14,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:14,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664013965] [2021-11-07 02:31:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:14,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:15,070 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 02:31:15,070 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:15,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664013965] [2021-11-07 02:31:15,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664013965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:15,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:15,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:15,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71646146] [2021-11-07 02:31:15,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:15,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:15,071 INFO L87 Difference]: Start difference. First operand 4873 states and 9683 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 02:31:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:17,349 INFO L93 Difference]: Finished difference Result 5224 states and 10380 transitions. [2021-11-07 02:31:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:31:17,349 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 02:31:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:17,354 INFO L225 Difference]: With dead ends: 5224 [2021-11-07 02:31:17,354 INFO L226 Difference]: Without dead ends: 5224 [2021-11-07 02:31:17,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:31:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2021-11-07 02:31:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 4884. [2021-11-07 02:31:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4884 states, 4814 states have (on average 2.0159950145409224) internal successors, (9705), 4883 states have internal predecessors, (9705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 9705 transitions. [2021-11-07 02:31:17,403 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 9705 transitions. Word has length 24 [2021-11-07 02:31:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:17,404 INFO L470 AbstractCegarLoop]: Abstraction has 4884 states and 9705 transitions. [2021-11-07 02:31:17,404 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 02:31:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 9705 transitions. [2021-11-07 02:31:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:17,404 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:17,404 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 02:31:17,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-11-07 02:31:17,405 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1876981324, now seen corresponding path program 22 times [2021-11-07 02:31:17,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:17,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650594155] [2021-11-07 02:31:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:17,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:17,843 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 02:31:17,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:17,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650594155] [2021-11-07 02:31:17,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650594155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:17,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:17,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:17,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910195746] [2021-11-07 02:31:17,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:17,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:17,844 INFO L87 Difference]: Start difference. First operand 4884 states and 9705 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 02:31:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:19,462 INFO L93 Difference]: Finished difference Result 5235 states and 10402 transitions. [2021-11-07 02:31:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:31:19,462 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 02:31:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:19,467 INFO L225 Difference]: With dead ends: 5235 [2021-11-07 02:31:19,467 INFO L226 Difference]: Without dead ends: 5235 [2021-11-07 02:31:19,467 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:31:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2021-11-07 02:31:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 4870. [2021-11-07 02:31:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4870 states, 4800 states have (on average 2.0160416666666667) internal successors, (9677), 4869 states have internal predecessors, (9677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 9677 transitions. [2021-11-07 02:31:19,516 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 9677 transitions. Word has length 24 [2021-11-07 02:31:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:19,516 INFO L470 AbstractCegarLoop]: Abstraction has 4870 states and 9677 transitions. [2021-11-07 02:31:19,517 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 02:31:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 9677 transitions. [2021-11-07 02:31:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:19,517 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:19,517 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 02:31:19,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-11-07 02:31:19,517 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1120585826, now seen corresponding path program 23 times [2021-11-07 02:31:19,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:19,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534721294] [2021-11-07 02:31:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:19,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:19,929 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 02:31:19,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:19,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534721294] [2021-11-07 02:31:19,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534721294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:19,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:19,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:19,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400774771] [2021-11-07 02:31:19,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:19,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:19,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:19,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:19,930 INFO L87 Difference]: Start difference. First operand 4870 states and 9677 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 02:31:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:22,148 INFO L93 Difference]: Finished difference Result 5202 states and 10336 transitions. [2021-11-07 02:31:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:31:22,148 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 02:31:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:22,153 INFO L225 Difference]: With dead ends: 5202 [2021-11-07 02:31:22,153 INFO L226 Difference]: Without dead ends: 5202 [2021-11-07 02:31:22,153 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:31:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2021-11-07 02:31:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 4885. [2021-11-07 02:31:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4885 states, 4815 states have (on average 2.015991692627207) internal successors, (9707), 4884 states have internal predecessors, (9707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4885 states to 4885 states and 9707 transitions. [2021-11-07 02:31:22,203 INFO L78 Accepts]: Start accepts. Automaton has 4885 states and 9707 transitions. Word has length 24 [2021-11-07 02:31:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:22,203 INFO L470 AbstractCegarLoop]: Abstraction has 4885 states and 9707 transitions. [2021-11-07 02:31:22,203 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 02:31:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4885 states and 9707 transitions. [2021-11-07 02:31:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:22,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:22,203 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 02:31:22,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-11-07 02:31:22,204 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash 956426196, now seen corresponding path program 24 times [2021-11-07 02:31:22,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:22,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327855894] [2021-11-07 02:31:22,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:22,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:22,574 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 02:31:22,574 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:22,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327855894] [2021-11-07 02:31:22,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327855894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:22,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:22,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:22,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91393940] [2021-11-07 02:31:22,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:22,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:22,575 INFO L87 Difference]: Start difference. First operand 4885 states and 9707 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 02:31:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:24,713 INFO L93 Difference]: Finished difference Result 5244 states and 10420 transitions. [2021-11-07 02:31:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:31:24,714 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 02:31:24,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:24,719 INFO L225 Difference]: With dead ends: 5244 [2021-11-07 02:31:24,719 INFO L226 Difference]: Without dead ends: 5244 [2021-11-07 02:31:24,719 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:31:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2021-11-07 02:31:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 4871. [2021-11-07 02:31:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4871 states, 4801 states have (on average 2.0160383253488856) internal successors, (9679), 4870 states have internal predecessors, (9679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 9679 transitions. [2021-11-07 02:31:24,768 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 9679 transitions. Word has length 24 [2021-11-07 02:31:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:24,768 INFO L470 AbstractCegarLoop]: Abstraction has 4871 states and 9679 transitions. [2021-11-07 02:31:24,768 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 02:31:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 9679 transitions. [2021-11-07 02:31:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:24,769 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:24,769 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 02:31:24,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-11-07 02:31:24,769 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1116416762, now seen corresponding path program 25 times [2021-11-07 02:31:24,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:24,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298059527] [2021-11-07 02:31:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:24,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:25,178 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 02:31:25,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:25,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298059527] [2021-11-07 02:31:25,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298059527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:25,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:25,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:25,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944892733] [2021-11-07 02:31:25,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:25,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:25,179 INFO L87 Difference]: Start difference. First operand 4871 states and 9679 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 02:31:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:26,864 INFO L93 Difference]: Finished difference Result 5236 states and 10404 transitions. [2021-11-07 02:31:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:31:26,865 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 02:31:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:26,869 INFO L225 Difference]: With dead ends: 5236 [2021-11-07 02:31:26,870 INFO L226 Difference]: Without dead ends: 5236 [2021-11-07 02:31:26,870 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:31:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2021-11-07 02:31:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 4897. [2021-11-07 02:31:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4897 states, 4827 states have (on average 2.015951937020924) internal successors, (9731), 4896 states have internal predecessors, (9731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 9731 transitions. [2021-11-07 02:31:26,919 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 9731 transitions. Word has length 24 [2021-11-07 02:31:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:26,919 INFO L470 AbstractCegarLoop]: Abstraction has 4897 states and 9731 transitions. [2021-11-07 02:31:26,919 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 02:31:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 9731 transitions. [2021-11-07 02:31:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:26,920 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:26,920 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 02:31:26,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-11-07 02:31:26,920 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:26,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1101538512, now seen corresponding path program 26 times [2021-11-07 02:31:26,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:26,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711955861] [2021-11-07 02:31:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:26,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:27,306 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 02:31:27,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:27,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711955861] [2021-11-07 02:31:27,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711955861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:27,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:27,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:27,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367873957] [2021-11-07 02:31:27,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:27,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:27,307 INFO L87 Difference]: Start difference. First operand 4897 states and 9731 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 02:31:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:29,747 INFO L93 Difference]: Finished difference Result 5256 states and 10444 transitions. [2021-11-07 02:31:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:31:29,747 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 02:31:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:29,752 INFO L225 Difference]: With dead ends: 5256 [2021-11-07 02:31:29,752 INFO L226 Difference]: Without dead ends: 5256 [2021-11-07 02:31:29,752 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:31:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2021-11-07 02:31:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 4881. [2021-11-07 02:31:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4881 states, 4811 states have (on average 2.0160049885678655) internal successors, (9699), 4880 states have internal predecessors, (9699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 9699 transitions. [2021-11-07 02:31:29,801 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 9699 transitions. Word has length 24 [2021-11-07 02:31:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:29,802 INFO L470 AbstractCegarLoop]: Abstraction has 4881 states and 9699 transitions. [2021-11-07 02:31:29,802 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 02:31:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 9699 transitions. [2021-11-07 02:31:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:29,802 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:29,803 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 02:31:29,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-11-07 02:31:29,803 INFO L402 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1222971170, now seen corresponding path program 27 times [2021-11-07 02:31:29,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:29,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402306812] [2021-11-07 02:31:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:29,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:30,123 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 02:31:30,124 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:30,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402306812] [2021-11-07 02:31:30,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402306812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:30,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:30,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:30,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282692307] [2021-11-07 02:31:30,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:30,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:30,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:30,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:30,125 INFO L87 Difference]: Start difference. First operand 4881 states and 9699 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 02:31:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:32,140 INFO L93 Difference]: Finished difference Result 5288 states and 10508 transitions. [2021-11-07 02:31:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:31:32,140 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 02:31:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:32,145 INFO L225 Difference]: With dead ends: 5288 [2021-11-07 02:31:32,145 INFO L226 Difference]: Without dead ends: 5288 [2021-11-07 02:31:32,145 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:31:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2021-11-07 02:31:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 4867. [2021-11-07 02:31:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 4797 states have (on average 2.0160516989785284) internal successors, (9671), 4866 states have internal predecessors, (9671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 9671 transitions. [2021-11-07 02:31:32,195 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 9671 transitions. Word has length 24 [2021-11-07 02:31:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:32,195 INFO L470 AbstractCegarLoop]: Abstraction has 4867 states and 9671 transitions. [2021-11-07 02:31:32,195 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 02:31:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 9671 transitions. [2021-11-07 02:31:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:32,196 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:32,196 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 02:31:32,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-11-07 02:31:32,196 INFO L402 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1520141798, now seen corresponding path program 28 times [2021-11-07 02:31:32,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:32,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266784236] [2021-11-07 02:31:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:32,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:32,586 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 02:31:32,586 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:32,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266784236] [2021-11-07 02:31:32,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266784236] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:32,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:32,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:32,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258440854] [2021-11-07 02:31:32,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:32,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:32,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:32,587 INFO L87 Difference]: Start difference. First operand 4867 states and 9671 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 02:31:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:34,120 INFO L93 Difference]: Finished difference Result 5203 states and 10338 transitions. [2021-11-07 02:31:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:31:34,120 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 02:31:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:34,125 INFO L225 Difference]: With dead ends: 5203 [2021-11-07 02:31:34,125 INFO L226 Difference]: Without dead ends: 5203 [2021-11-07 02:31:34,125 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:31:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5203 states. [2021-11-07 02:31:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5203 to 4883. [2021-11-07 02:31:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4883 states, 4813 states have (on average 2.01599833783503) internal successors, (9703), 4882 states have internal predecessors, (9703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 9703 transitions. [2021-11-07 02:31:34,174 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 9703 transitions. Word has length 24 [2021-11-07 02:31:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:34,175 INFO L470 AbstractCegarLoop]: Abstraction has 4883 states and 9703 transitions. [2021-11-07 02:31:34,175 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 02:31:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 9703 transitions. [2021-11-07 02:31:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:34,176 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:34,176 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 02:31:34,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-11-07 02:31:34,176 INFO L402 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash 556870224, now seen corresponding path program 29 times [2021-11-07 02:31:34,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:34,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343317185] [2021-11-07 02:31:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:34,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:34,527 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 02:31:34,527 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:34,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343317185] [2021-11-07 02:31:34,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343317185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:34,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:34,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:34,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988139671] [2021-11-07 02:31:34,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:34,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:34,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:34,528 INFO L87 Difference]: Start difference. First operand 4883 states and 9703 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 02:31:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:36,140 INFO L93 Difference]: Finished difference Result 5214 states and 10360 transitions. [2021-11-07 02:31:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:31:36,141 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 02:31:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:36,145 INFO L225 Difference]: With dead ends: 5214 [2021-11-07 02:31:36,145 INFO L226 Difference]: Without dead ends: 5214 [2021-11-07 02:31:36,146 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:31:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2021-11-07 02:31:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 4869. [2021-11-07 02:31:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4799 states have (on average 2.0160450093769535) internal successors, (9675), 4868 states have internal predecessors, (9675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 9675 transitions. [2021-11-07 02:31:36,195 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 9675 transitions. Word has length 24 [2021-11-07 02:31:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:36,195 INFO L470 AbstractCegarLoop]: Abstraction has 4869 states and 9675 transitions. [2021-11-07 02:31:36,195 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 02:31:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 9675 transitions. [2021-11-07 02:31:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:36,196 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:36,196 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 02:31:36,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-11-07 02:31:36,196 INFO L402 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash 716860790, now seen corresponding path program 30 times [2021-11-07 02:31:36,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:36,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316543271] [2021-11-07 02:31:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:36,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:36,613 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 02:31:36,614 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:36,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316543271] [2021-11-07 02:31:36,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316543271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:36,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:36,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:36,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882682643] [2021-11-07 02:31:36,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:36,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:36,615 INFO L87 Difference]: Start difference. First operand 4869 states and 9675 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 02:31:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:38,237 INFO L93 Difference]: Finished difference Result 5245 states and 10422 transitions. [2021-11-07 02:31:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:31:38,237 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 02:31:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:38,242 INFO L225 Difference]: With dead ends: 5245 [2021-11-07 02:31:38,242 INFO L226 Difference]: Without dead ends: 5245 [2021-11-07 02:31:38,242 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:31:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5245 states. [2021-11-07 02:31:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5245 to 4895. [2021-11-07 02:31:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4895 states, 4825 states have (on average 2.015958549222798) internal successors, (9727), 4894 states have internal predecessors, (9727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 9727 transitions. [2021-11-07 02:31:38,290 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 9727 transitions. Word has length 24 [2021-11-07 02:31:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:38,290 INFO L470 AbstractCegarLoop]: Abstraction has 4895 states and 9727 transitions. [2021-11-07 02:31:38,290 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 02:31:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 9727 transitions. [2021-11-07 02:31:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:38,291 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:38,291 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 02:31:38,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-11-07 02:31:38,291 INFO L402 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1501094484, now seen corresponding path program 31 times [2021-11-07 02:31:38,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:38,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484032602] [2021-11-07 02:31:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:38,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:38,645 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 02:31:38,645 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:38,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484032602] [2021-11-07 02:31:38,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484032602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:38,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:38,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:38,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924187697] [2021-11-07 02:31:38,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:38,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:38,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:38,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:38,646 INFO L87 Difference]: Start difference. First operand 4895 states and 9727 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 02:31:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:40,875 INFO L93 Difference]: Finished difference Result 5251 states and 10434 transitions. [2021-11-07 02:31:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:31:40,876 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 02:31:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:40,880 INFO L225 Difference]: With dead ends: 5251 [2021-11-07 02:31:40,881 INFO L226 Difference]: Without dead ends: 5251 [2021-11-07 02:31:40,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:31:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5251 states. [2021-11-07 02:31:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5251 to 4882. [2021-11-07 02:31:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4812 states have (on average 2.0160016625103907) internal successors, (9701), 4881 states have internal predecessors, (9701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 9701 transitions. [2021-11-07 02:31:40,930 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 9701 transitions. Word has length 24 [2021-11-07 02:31:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:40,930 INFO L470 AbstractCegarLoop]: Abstraction has 4882 states and 9701 transitions. [2021-11-07 02:31:40,930 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 02:31:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 9701 transitions. [2021-11-07 02:31:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:40,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:40,931 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 02:31:40,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-11-07 02:31:40,931 INFO L402 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 823415198, now seen corresponding path program 32 times [2021-11-07 02:31:40,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:40,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888145677] [2021-11-07 02:31:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:40,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:41,246 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 02:31:41,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:41,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888145677] [2021-11-07 02:31:41,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888145677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:41,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:41,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:41,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529107325] [2021-11-07 02:31:41,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:41,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:41,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:41,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:41,247 INFO L87 Difference]: Start difference. First operand 4882 states and 9701 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 02:31:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:43,115 INFO L93 Difference]: Finished difference Result 5305 states and 10542 transitions. [2021-11-07 02:31:43,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:31:43,115 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 02:31:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:43,120 INFO L225 Difference]: With dead ends: 5305 [2021-11-07 02:31:43,120 INFO L226 Difference]: Without dead ends: 5305 [2021-11-07 02:31:43,120 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:31:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2021-11-07 02:31:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 4868. [2021-11-07 02:31:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4798 states have (on average 2.016048353480617) internal successors, (9673), 4867 states have internal predecessors, (9673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 9673 transitions. [2021-11-07 02:31:43,169 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 9673 transitions. Word has length 24 [2021-11-07 02:31:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:43,169 INFO L470 AbstractCegarLoop]: Abstraction has 4868 states and 9673 transitions. [2021-11-07 02:31:43,169 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 02:31:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 9673 transitions. [2021-11-07 02:31:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:43,170 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:43,170 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 02:31:43,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-11-07 02:31:43,170 INFO L402 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 451015190, now seen corresponding path program 33 times [2021-11-07 02:31:43,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:43,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683544005] [2021-11-07 02:31:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:43,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:43,550 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 02:31:43,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:43,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683544005] [2021-11-07 02:31:43,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683544005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:43,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:43,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:43,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673811134] [2021-11-07 02:31:43,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:43,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:43,551 INFO L87 Difference]: Start difference. First operand 4868 states and 9673 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 02:31:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:45,070 INFO L93 Difference]: Finished difference Result 5262 states and 10456 transitions. [2021-11-07 02:31:45,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:31:45,070 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 02:31:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:45,075 INFO L225 Difference]: With dead ends: 5262 [2021-11-07 02:31:45,075 INFO L226 Difference]: Without dead ends: 5262 [2021-11-07 02:31:45,075 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:31:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5262 states. [2021-11-07 02:31:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5262 to 4907. [2021-11-07 02:31:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4907 states, 4837 states have (on average 2.015918958031838) internal successors, (9751), 4906 states have internal predecessors, (9751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 9751 transitions. [2021-11-07 02:31:45,125 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 9751 transitions. Word has length 24 [2021-11-07 02:31:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:45,125 INFO L470 AbstractCegarLoop]: Abstraction has 4907 states and 9751 transitions. [2021-11-07 02:31:45,125 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 02:31:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 9751 transitions. [2021-11-07 02:31:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:45,125 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:45,125 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 02:31:45,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-11-07 02:31:45,126 INFO L402 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1766940084, now seen corresponding path program 34 times [2021-11-07 02:31:45,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:45,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564469176] [2021-11-07 02:31:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:45,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:45,493 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 02:31:45,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:45,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564469176] [2021-11-07 02:31:45,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564469176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:45,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:45,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:45,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879345338] [2021-11-07 02:31:45,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:45,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:45,494 INFO L87 Difference]: Start difference. First operand 4907 states and 9751 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 02:31:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:47,355 INFO L93 Difference]: Finished difference Result 5276 states and 10484 transitions. [2021-11-07 02:31:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:31:47,356 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 02:31:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:47,360 INFO L225 Difference]: With dead ends: 5276 [2021-11-07 02:31:47,361 INFO L226 Difference]: Without dead ends: 5276 [2021-11-07 02:31:47,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:31:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5276 states. [2021-11-07 02:31:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5276 to 4894. [2021-11-07 02:31:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 4824 states have (on average 2.015961857379768) internal successors, (9725), 4893 states have internal predecessors, (9725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 9725 transitions. [2021-11-07 02:31:47,445 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 9725 transitions. Word has length 24 [2021-11-07 02:31:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:47,445 INFO L470 AbstractCegarLoop]: Abstraction has 4894 states and 9725 transitions. [2021-11-07 02:31:47,446 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 02:31:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 9725 transitions. [2021-11-07 02:31:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:47,446 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:47,446 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 02:31:47,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-11-07 02:31:47,446 INFO L402 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 557569598, now seen corresponding path program 35 times [2021-11-07 02:31:47,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:47,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260047251] [2021-11-07 02:31:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:47,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:47,816 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 02:31:47,816 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:47,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260047251] [2021-11-07 02:31:47,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260047251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:47,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:47,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:47,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574504503] [2021-11-07 02:31:47,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:47,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:47,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:47,817 INFO L87 Difference]: Start difference. First operand 4894 states and 9725 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 02:31:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:50,271 INFO L93 Difference]: Finished difference Result 5317 states and 10566 transitions. [2021-11-07 02:31:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:31:50,271 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 02:31:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:50,276 INFO L225 Difference]: With dead ends: 5317 [2021-11-07 02:31:50,276 INFO L226 Difference]: Without dead ends: 5317 [2021-11-07 02:31:50,277 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:31:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2021-11-07 02:31:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 4878. [2021-11-07 02:31:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4808 states have (on average 2.0160149750415974) internal successors, (9693), 4877 states have internal predecessors, (9693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 9693 transitions. [2021-11-07 02:31:50,326 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 9693 transitions. Word has length 24 [2021-11-07 02:31:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:50,326 INFO L470 AbstractCegarLoop]: Abstraction has 4878 states and 9693 transitions. [2021-11-07 02:31:50,327 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 02:31:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 9693 transitions. [2021-11-07 02:31:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:50,327 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:50,327 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 02:31:50,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-11-07 02:31:50,327 INFO L402 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -824952944, now seen corresponding path program 36 times [2021-11-07 02:31:50,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:50,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237178264] [2021-11-07 02:31:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:50,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:50,598 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 02:31:50,598 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:50,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237178264] [2021-11-07 02:31:50,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237178264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:50,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:50,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:50,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53724161] [2021-11-07 02:31:50,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:50,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:50,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:50,599 INFO L87 Difference]: Start difference. First operand 4878 states and 9693 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 02:31:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:52,104 INFO L93 Difference]: Finished difference Result 5330 states and 10592 transitions. [2021-11-07 02:31:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:31:52,105 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 02:31:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:52,110 INFO L225 Difference]: With dead ends: 5330 [2021-11-07 02:31:52,110 INFO L226 Difference]: Without dead ends: 5330 [2021-11-07 02:31:52,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:31:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2021-11-07 02:31:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 4864. [2021-11-07 02:31:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4864 states, 4794 states have (on average 2.0160617438464747) internal successors, (9665), 4863 states have internal predecessors, (9665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4864 states to 4864 states and 9665 transitions. [2021-11-07 02:31:52,160 INFO L78 Accepts]: Start accepts. Automaton has 4864 states and 9665 transitions. Word has length 24 [2021-11-07 02:31:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:52,160 INFO L470 AbstractCegarLoop]: Abstraction has 4864 states and 9665 transitions. [2021-11-07 02:31:52,160 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 02:31:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4864 states and 9665 transitions. [2021-11-07 02:31:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:52,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:52,161 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 02:31:52,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-11-07 02:31:52,161 INFO L402 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:52,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash 895487656, now seen corresponding path program 37 times [2021-11-07 02:31:52,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:52,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431314313] [2021-11-07 02:31:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:52,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:52,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 02:31:52,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:52,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431314313] [2021-11-07 02:31:52,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431314313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:52,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:52,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:52,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870450719] [2021-11-07 02:31:52,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:52,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:52,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:52,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:52,575 INFO L87 Difference]: Start difference. First operand 4864 states and 9665 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 02:31:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:54,568 INFO L93 Difference]: Finished difference Result 9626 states and 19109 transitions. [2021-11-07 02:31:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:31:54,569 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 02:31:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:54,578 INFO L225 Difference]: With dead ends: 9626 [2021-11-07 02:31:54,578 INFO L226 Difference]: Without dead ends: 9626 [2021-11-07 02:31:54,579 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:31:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2021-11-07 02:31:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 4876. [2021-11-07 02:31:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4806 states have (on average 2.0160216396171453) internal successors, (9689), 4875 states have internal predecessors, (9689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 9689 transitions. [2021-11-07 02:31:54,648 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 9689 transitions. Word has length 24 [2021-11-07 02:31:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:54,649 INFO L470 AbstractCegarLoop]: Abstraction has 4876 states and 9689 transitions. [2021-11-07 02:31:54,649 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 02:31:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 9689 transitions. [2021-11-07 02:31:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:54,649 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:54,649 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 02:31:54,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2021-11-07 02:31:54,650 INFO L402 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1322467618, now seen corresponding path program 38 times [2021-11-07 02:31:54,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:54,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699748393] [2021-11-07 02:31:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:54,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:55,005 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 02:31:55,006 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:55,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699748393] [2021-11-07 02:31:55,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699748393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:55,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:55,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:55,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146722531] [2021-11-07 02:31:55,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:55,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:55,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:55,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:55,007 INFO L87 Difference]: Start difference. First operand 4876 states and 9689 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 02:31:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:56,866 INFO L93 Difference]: Finished difference Result 9644 states and 19145 transitions. [2021-11-07 02:31:56,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:31:56,866 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 02:31:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:56,880 INFO L225 Difference]: With dead ends: 9644 [2021-11-07 02:31:56,881 INFO L226 Difference]: Without dead ends: 9644 [2021-11-07 02:31:56,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:31:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2021-11-07 02:31:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 4862. [2021-11-07 02:31:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4862 states, 4792 states have (on average 2.016068447412354) internal successors, (9661), 4861 states have internal predecessors, (9661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 9661 transitions. [2021-11-07 02:31:56,983 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 9661 transitions. Word has length 24 [2021-11-07 02:31:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:56,984 INFO L470 AbstractCegarLoop]: Abstraction has 4862 states and 9661 transitions. [2021-11-07 02:31:56,984 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 02:31:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 9661 transitions. [2021-11-07 02:31:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:56,984 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:56,984 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 02:31:56,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-11-07 02:31:56,984 INFO L402 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1162477052, now seen corresponding path program 39 times [2021-11-07 02:31:56,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:56,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317916845] [2021-11-07 02:31:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:56,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:57,363 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 02:31:57,363 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:57,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317916845] [2021-11-07 02:31:57,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317916845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:57,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:57,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:57,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39505327] [2021-11-07 02:31:57,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:57,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:57,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:57,364 INFO L87 Difference]: Start difference. First operand 4862 states and 9661 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 02:31:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:31:59,291 INFO L93 Difference]: Finished difference Result 9661 states and 19179 transitions. [2021-11-07 02:31:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:31:59,291 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 02:31:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:31:59,301 INFO L225 Difference]: With dead ends: 9661 [2021-11-07 02:31:59,301 INFO L226 Difference]: Without dead ends: 9661 [2021-11-07 02:31:59,301 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:31:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9661 states. [2021-11-07 02:31:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9661 to 4888. [2021-11-07 02:31:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 4818 states have (on average 2.0159817351598175) internal successors, (9713), 4887 states have internal predecessors, (9713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:31:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 9713 transitions. [2021-11-07 02:31:59,372 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 9713 transitions. Word has length 24 [2021-11-07 02:31:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:31:59,372 INFO L470 AbstractCegarLoop]: Abstraction has 4888 states and 9713 transitions. [2021-11-07 02:31:59,372 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 02:31:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 9713 transitions. [2021-11-07 02:31:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:31:59,373 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:31:59,373 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 02:31:59,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-11-07 02:31:59,373 INFO L402 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:31:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:31:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash 914534970, now seen corresponding path program 40 times [2021-11-07 02:31:59,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:31:59,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926420790] [2021-11-07 02:31:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:31:59,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:31:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:31:59,740 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 02:31:59,740 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:31:59,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926420790] [2021-11-07 02:31:59,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926420790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:31:59,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:31:59,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:31:59,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371788455] [2021-11-07 02:31:59,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:31:59,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:31:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:31:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:31:59,741 INFO L87 Difference]: Start difference. First operand 4888 states and 9713 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 02:32:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:02,143 INFO L93 Difference]: Finished difference Result 9681 states and 19219 transitions. [2021-11-07 02:32:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:32:02,144 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 02:32:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:02,152 INFO L225 Difference]: With dead ends: 9681 [2021-11-07 02:32:02,153 INFO L226 Difference]: Without dead ends: 9681 [2021-11-07 02:32:02,153 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:32:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9681 states. [2021-11-07 02:32:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9681 to 4875. [2021-11-07 02:32:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4805 states have (on average 2.0160249739854317) internal successors, (9687), 4874 states have internal predecessors, (9687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 9687 transitions. [2021-11-07 02:32:02,219 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 9687 transitions. Word has length 24 [2021-11-07 02:32:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:02,219 INFO L470 AbstractCegarLoop]: Abstraction has 4875 states and 9687 transitions. [2021-11-07 02:32:02,219 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 02:32:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 9687 transitions. [2021-11-07 02:32:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:02,220 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:02,220 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 02:32:02,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2021-11-07 02:32:02,220 INFO L402 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:02,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1055922644, now seen corresponding path program 41 times [2021-11-07 02:32:02,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:02,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195680236] [2021-11-07 02:32:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:02,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:02,527 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 02:32:02,528 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:02,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195680236] [2021-11-07 02:32:02,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195680236] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:02,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:02,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:02,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359324577] [2021-11-07 02:32:02,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:02,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:02,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:02,529 INFO L87 Difference]: Start difference. First operand 4875 states and 9687 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 02:32:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:04,319 INFO L93 Difference]: Finished difference Result 9692 states and 19241 transitions. [2021-11-07 02:32:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:32:04,319 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 02:32:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:04,329 INFO L225 Difference]: With dead ends: 9692 [2021-11-07 02:32:04,329 INFO L226 Difference]: Without dead ends: 9692 [2021-11-07 02:32:04,329 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2021-11-07 02:32:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2021-11-07 02:32:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 4861. [2021-11-07 02:32:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4861 states, 4791 states have (on average 2.016071801294093) internal successors, (9659), 4860 states have internal predecessors, (9659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 9659 transitions. [2021-11-07 02:32:04,399 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 9659 transitions. Word has length 24 [2021-11-07 02:32:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:04,399 INFO L470 AbstractCegarLoop]: Abstraction has 4861 states and 9659 transitions. [2021-11-07 02:32:04,399 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 02:32:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 9659 transitions. [2021-11-07 02:32:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:04,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:04,400 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 02:32:04,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-11-07 02:32:04,400 INFO L402 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1428322652, now seen corresponding path program 42 times [2021-11-07 02:32:04,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:04,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749481120] [2021-11-07 02:32:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:04,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:04,861 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 02:32:04,861 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:04,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749481120] [2021-11-07 02:32:04,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749481120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:04,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:04,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:04,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754341970] [2021-11-07 02:32:04,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:04,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:04,862 INFO L87 Difference]: Start difference. First operand 4861 states and 9659 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 02:32:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:06,451 INFO L93 Difference]: Finished difference Result 9689 states and 19235 transitions. [2021-11-07 02:32:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:32:06,451 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 02:32:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:06,460 INFO L225 Difference]: With dead ends: 9689 [2021-11-07 02:32:06,460 INFO L226 Difference]: Without dead ends: 9689 [2021-11-07 02:32:06,461 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:32:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9689 states. [2021-11-07 02:32:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9689 to 4900. [2021-11-07 02:32:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4900 states, 4830 states have (on average 2.0159420289855072) internal successors, (9737), 4899 states have internal predecessors, (9737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 9737 transitions. [2021-11-07 02:32:06,528 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 9737 transitions. Word has length 24 [2021-11-07 02:32:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:06,528 INFO L470 AbstractCegarLoop]: Abstraction has 4900 states and 9737 transitions. [2021-11-07 02:32:06,528 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 02:32:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 9737 transitions. [2021-11-07 02:32:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:06,529 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:06,529 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 02:32:06,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-11-07 02:32:06,529 INFO L402 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 648689370, now seen corresponding path program 43 times [2021-11-07 02:32:06,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:06,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966356701] [2021-11-07 02:32:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:06,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:06,880 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 02:32:06,880 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:06,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966356701] [2021-11-07 02:32:06,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966356701] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:06,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:06,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:06,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915323882] [2021-11-07 02:32:06,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:06,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:06,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:06,881 INFO L87 Difference]: Start difference. First operand 4900 states and 9737 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 02:32:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:09,347 INFO L93 Difference]: Finished difference Result 9703 states and 19263 transitions. [2021-11-07 02:32:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:32:09,348 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 02:32:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:09,357 INFO L225 Difference]: With dead ends: 9703 [2021-11-07 02:32:09,357 INFO L226 Difference]: Without dead ends: 9703 [2021-11-07 02:32:09,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:32:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9703 states. [2021-11-07 02:32:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9703 to 4887. [2021-11-07 02:32:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4817 states have (on average 2.015985052937513) internal successors, (9711), 4886 states have internal predecessors, (9711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 9711 transitions. [2021-11-07 02:32:09,428 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 9711 transitions. Word has length 24 [2021-11-07 02:32:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:09,428 INFO L470 AbstractCegarLoop]: Abstraction has 4887 states and 9711 transitions. [2021-11-07 02:32:09,428 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 02:32:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 9711 transitions. [2021-11-07 02:32:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:09,429 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:09,429 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 02:32:09,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-11-07 02:32:09,429 INFO L402 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1321768244, now seen corresponding path program 44 times [2021-11-07 02:32:09,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:09,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510015967] [2021-11-07 02:32:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:09,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32: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 02:32:09,741 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:09,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510015967] [2021-11-07 02:32:09,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510015967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:09,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:09,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:09,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360668406] [2021-11-07 02:32:09,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:09,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:09,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:09,742 INFO L87 Difference]: Start difference. First operand 4887 states and 9711 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 02:32:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:12,176 INFO L93 Difference]: Finished difference Result 9744 states and 19345 transitions. [2021-11-07 02:32:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:32:12,176 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 02:32:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:12,186 INFO L225 Difference]: With dead ends: 9744 [2021-11-07 02:32:12,186 INFO L226 Difference]: Without dead ends: 9744 [2021-11-07 02:32:12,186 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2021-11-07 02:32:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9744 states. [2021-11-07 02:32:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9744 to 4874. [2021-11-07 02:32:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4804 states have (on average 2.016028309741882) internal successors, (9685), 4873 states have internal predecessors, (9685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 9685 transitions. [2021-11-07 02:32:12,256 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 9685 transitions. Word has length 24 [2021-11-07 02:32:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:12,256 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 9685 transitions. [2021-11-07 02:32:12,256 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 02:32:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 9685 transitions. [2021-11-07 02:32:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:12,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:12,257 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 02:32:12,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-11-07 02:32:12,257 INFO L402 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:12,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1590676510, now seen corresponding path program 45 times [2021-11-07 02:32:12,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:12,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966682193] [2021-11-07 02:32:12,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:12,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:12,513 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 02:32:12,514 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:12,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966682193] [2021-11-07 02:32:12,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966682193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:12,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:12,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:12,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802126714] [2021-11-07 02:32:12,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:12,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:12,515 INFO L87 Difference]: Start difference. First operand 4874 states and 9685 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 02:32:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:14,786 INFO L93 Difference]: Finished difference Result 9912 states and 19673 transitions. [2021-11-07 02:32:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 02:32:14,786 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 02:32:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:14,796 INFO L225 Difference]: With dead ends: 9912 [2021-11-07 02:32:14,796 INFO L226 Difference]: Without dead ends: 9912 [2021-11-07 02:32:14,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=786, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 02:32:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9912 states. [2021-11-07 02:32:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9912 to 4860. [2021-11-07 02:32:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4860 states, 4790 states have (on average 2.0160751565762003) internal successors, (9657), 4859 states have internal predecessors, (9657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 9657 transitions. [2021-11-07 02:32:14,867 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 9657 transitions. Word has length 24 [2021-11-07 02:32:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:14,867 INFO L470 AbstractCegarLoop]: Abstraction has 4860 states and 9657 transitions. [2021-11-07 02:32:14,868 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 02:32:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 9657 transitions. [2021-11-07 02:32:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:14,868 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:14,868 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 02:32:14,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-11-07 02:32:14,868 INFO L402 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1433406150, now seen corresponding path program 46 times [2021-11-07 02:32:14,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:14,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958441249] [2021-11-07 02:32:14,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:14,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:15,267 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 02:32:15,268 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:15,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958441249] [2021-11-07 02:32:15,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958441249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:15,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:15,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:15,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382765825] [2021-11-07 02:32:15,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:15,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:15,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:15,269 INFO L87 Difference]: Start difference. First operand 4860 states and 9657 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 02:32:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:17,195 INFO L93 Difference]: Finished difference Result 9524 states and 18905 transitions. [2021-11-07 02:32:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:32:17,195 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 02:32:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:17,205 INFO L225 Difference]: With dead ends: 9524 [2021-11-07 02:32:17,205 INFO L226 Difference]: Without dead ends: 9524 [2021-11-07 02:32:17,205 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:32:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9524 states. [2021-11-07 02:32:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9524 to 4847. [2021-11-07 02:32:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4847 states, 4777 states have (on average 2.016118903077245) internal successors, (9631), 4846 states have internal predecessors, (9631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 9631 transitions. [2021-11-07 02:32:17,274 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 9631 transitions. Word has length 24 [2021-11-07 02:32:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:17,274 INFO L470 AbstractCegarLoop]: Abstraction has 4847 states and 9631 transitions. [2021-11-07 02:32:17,275 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 02:32:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 9631 transitions. [2021-11-07 02:32:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:17,275 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:17,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 02:32:17,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-11-07 02:32:17,275 INFO L402 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 643605872, now seen corresponding path program 47 times [2021-11-07 02:32:17,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:17,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291357390] [2021-11-07 02:32:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:17,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:17,619 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 02:32:17,619 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:17,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291357390] [2021-11-07 02:32:17,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291357390] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:17,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:17,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:17,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366149020] [2021-11-07 02:32:17,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:17,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:17,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:17,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:17,620 INFO L87 Difference]: Start difference. First operand 4847 states and 9631 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 02:32:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:20,081 INFO L93 Difference]: Finished difference Result 9535 states and 18927 transitions. [2021-11-07 02:32:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:32:20,082 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 02:32:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:20,096 INFO L225 Difference]: With dead ends: 9535 [2021-11-07 02:32:20,096 INFO L226 Difference]: Without dead ends: 9535 [2021-11-07 02:32:20,096 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:32:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9535 states. [2021-11-07 02:32:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9535 to 4834. [2021-11-07 02:32:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4834 states, 4764 states have (on average 2.016162888329135) internal successors, (9605), 4833 states have internal predecessors, (9605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 9605 transitions. [2021-11-07 02:32:20,208 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 9605 transitions. Word has length 24 [2021-11-07 02:32:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:20,208 INFO L470 AbstractCegarLoop]: Abstraction has 4834 states and 9605 transitions. [2021-11-07 02:32:20,208 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 02:32:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 9605 transitions. [2021-11-07 02:32:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:20,208 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:20,208 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 02:32:20,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-11-07 02:32:20,209 INFO L402 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:20,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1326851742, now seen corresponding path program 48 times [2021-11-07 02:32:20,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:20,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450698647] [2021-11-07 02:32:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:20,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:20,556 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 02:32:20,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:20,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450698647] [2021-11-07 02:32:20,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450698647] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:20,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:20,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:20,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404289198] [2021-11-07 02:32:20,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:20,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:20,557 INFO L87 Difference]: Start difference. First operand 4834 states and 9605 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 02:32:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:23,207 INFO L93 Difference]: Finished difference Result 9560 states and 18977 transitions. [2021-11-07 02:32:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:32:23,208 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 02:32:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:23,221 INFO L225 Difference]: With dead ends: 9560 [2021-11-07 02:32:23,222 INFO L226 Difference]: Without dead ends: 9560 [2021-11-07 02:32:23,222 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:32:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9560 states. [2021-11-07 02:32:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9560 to 4821. [2021-11-07 02:32:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 4751 states have (on average 2.016207114291728) internal successors, (9579), 4820 states have internal predecessors, (9579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 9579 transitions. [2021-11-07 02:32:23,311 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 9579 transitions. Word has length 24 [2021-11-07 02:32:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:23,311 INFO L470 AbstractCegarLoop]: Abstraction has 4821 states and 9579 transitions. [2021-11-07 02:32:23,311 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 02:32:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 9579 transitions. [2021-11-07 02:32:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:32:23,311 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:23,311 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 02:32:23,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-11-07 02:32:23,312 INFO L402 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1585593012, now seen corresponding path program 49 times [2021-11-07 02:32:23,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:23,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417239359] [2021-11-07 02:32:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:23,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:23,625 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 02:32:23,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:23,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417239359] [2021-11-07 02:32:23,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417239359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:23,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:23,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:23,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969418932] [2021-11-07 02:32:23,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:23,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:23,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:23,626 INFO L87 Difference]: Start difference. First operand 4821 states and 9579 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 02:32:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:26,382 INFO L93 Difference]: Finished difference Result 9695 states and 19239 transitions. [2021-11-07 02:32:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:32:26,382 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 02:32:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:26,393 INFO L225 Difference]: With dead ends: 9695 [2021-11-07 02:32:26,394 INFO L226 Difference]: Without dead ends: 9695 [2021-11-07 02:32:26,394 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=718, Unknown=0, NotChecked=0, Total=992 [2021-11-07 02:32:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9695 states. [2021-11-07 02:32:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9695 to 4774. [2021-11-07 02:32:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4704 states have (on average 2.0163690476190474) internal successors, (9485), 4773 states have internal predecessors, (9485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 9485 transitions. [2021-11-07 02:32:26,484 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 9485 transitions. Word has length 24 [2021-11-07 02:32:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:26,484 INFO L470 AbstractCegarLoop]: Abstraction has 4774 states and 9485 transitions. [2021-11-07 02:32:26,484 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 02:32:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 9485 transitions. [2021-11-07 02:32:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:32:26,485 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:26,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, 1, 1, 1] [2021-11-07 02:32:26,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-11-07 02:32:26,485 INFO L402 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash -377818386, now seen corresponding path program 1 times [2021-11-07 02:32:26,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:26,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35158252] [2021-11-07 02:32:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:26,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:26,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 02:32:26,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:26,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35158252] [2021-11-07 02:32:26,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35158252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:26,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:26,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:32:26,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473504415] [2021-11-07 02:32:26,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:32:26,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:32:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:32:26,563 INFO L87 Difference]: Start difference. First operand 4774 states and 9485 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 02:32:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:27,346 INFO L93 Difference]: Finished difference Result 5041 states and 10013 transitions. [2021-11-07 02:32:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:32:27,346 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 02:32:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:27,352 INFO L225 Difference]: With dead ends: 5041 [2021-11-07 02:32:27,353 INFO L226 Difference]: Without dead ends: 5041 [2021-11-07 02:32:27,353 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 02:32:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states. [2021-11-07 02:32:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 4976. [2021-11-07 02:32:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4976 states, 4906 states have (on average 2.0146759070525886) internal successors, (9884), 4975 states have internal predecessors, (9884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4976 states to 4976 states and 9884 transitions. [2021-11-07 02:32:27,420 INFO L78 Accepts]: Start accepts. Automaton has 4976 states and 9884 transitions. Word has length 27 [2021-11-07 02:32:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:27,420 INFO L470 AbstractCegarLoop]: Abstraction has 4976 states and 9884 transitions. [2021-11-07 02:32:27,420 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 02:32:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4976 states and 9884 transitions. [2021-11-07 02:32:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 02:32:27,421 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:27,421 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] [2021-11-07 02:32:27,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-11-07 02:32:27,421 INFO L402 AbstractCegarLoop]: === Iteration 184 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash -696858585, now seen corresponding path program 1 times [2021-11-07 02:32:27,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:27,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648082423] [2021-11-07 02:32:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:27,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:27,517 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 02:32:27,518 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:27,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648082423] [2021-11-07 02:32:27,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648082423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:27,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:27,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:32:27,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711332739] [2021-11-07 02:32:27,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:32:27,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:32:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:32:27,519 INFO L87 Difference]: Start difference. First operand 4976 states and 9884 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:28,773 INFO L93 Difference]: Finished difference Result 5317 states and 10565 transitions. [2021-11-07 02:32:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:32:28,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-07 02:32:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:28,781 INFO L225 Difference]: With dead ends: 5317 [2021-11-07 02:32:28,781 INFO L226 Difference]: Without dead ends: 5317 [2021-11-07 02:32:28,781 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 02:32:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2021-11-07 02:32:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5238. [2021-11-07 02:32:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5238 states, 5168 states have (on average 2.0137383900928794) internal successors, (10407), 5237 states have internal predecessors, (10407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 10407 transitions. [2021-11-07 02:32:28,863 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 10407 transitions. Word has length 28 [2021-11-07 02:32:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:28,863 INFO L470 AbstractCegarLoop]: Abstraction has 5238 states and 10407 transitions. [2021-11-07 02:32:28,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 10407 transitions. [2021-11-07 02:32:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:28,864 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:28,864 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 02:32:28,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-11-07 02:32:28,864 INFO L402 AbstractCegarLoop]: === Iteration 185 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1495584848, now seen corresponding path program 1 times [2021-11-07 02:32:28,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:28,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486438468] [2021-11-07 02:32:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:28,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:29,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 02:32:29,039 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:29,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486438468] [2021-11-07 02:32:29,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486438468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:29,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:29,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:32:29,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973462867] [2021-11-07 02:32:29,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:32:29,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:32:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:32:29,041 INFO L87 Difference]: Start difference. First operand 5238 states and 10407 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:32,575 INFO L93 Difference]: Finished difference Result 9272 states and 18409 transitions. [2021-11-07 02:32:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 02:32:32,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:32,589 INFO L225 Difference]: With dead ends: 9272 [2021-11-07 02:32:32,589 INFO L226 Difference]: Without dead ends: 9272 [2021-11-07 02:32:32,589 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:32:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9272 states. [2021-11-07 02:32:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9272 to 5427. [2021-11-07 02:32:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5427 states, 5357 states have (on average 2.017547134590256) internal successors, (10808), 5426 states have internal predecessors, (10808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 10808 transitions. [2021-11-07 02:32:32,687 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 10808 transitions. Word has length 30 [2021-11-07 02:32:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:32,688 INFO L470 AbstractCegarLoop]: Abstraction has 5427 states and 10808 transitions. [2021-11-07 02:32:32,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 10808 transitions. [2021-11-07 02:32:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:32,688 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:32,689 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 02:32:32,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-11-07 02:32:32,689 INFO L402 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash 693945948, now seen corresponding path program 1 times [2021-11-07 02:32:32,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:32,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140028003] [2021-11-07 02:32:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:32,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:33,079 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 02:32:33,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:33,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140028003] [2021-11-07 02:32:33,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140028003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:33,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:33,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:33,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581341828] [2021-11-07 02:32:33,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:33,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:33,081 INFO L87 Difference]: Start difference. First operand 5427 states and 10808 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:35,447 INFO L93 Difference]: Finished difference Result 10470 states and 20761 transitions. [2021-11-07 02:32:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:32:35,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:35,465 INFO L225 Difference]: With dead ends: 10470 [2021-11-07 02:32:35,465 INFO L226 Difference]: Without dead ends: 10470 [2021-11-07 02:32:35,465 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2021-11-07 02:32:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10470 states. [2021-11-07 02:32:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10470 to 5979. [2021-11-07 02:32:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5979 states, 5909 states have (on average 2.027923506515485) internal successors, (11983), 5978 states have internal predecessors, (11983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 11983 transitions. [2021-11-07 02:32:35,581 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 11983 transitions. Word has length 30 [2021-11-07 02:32:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:35,581 INFO L470 AbstractCegarLoop]: Abstraction has 5979 states and 11983 transitions. [2021-11-07 02:32:35,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 11983 transitions. [2021-11-07 02:32:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:35,583 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:35,583 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 02:32:35,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-11-07 02:32:35,583 INFO L402 AbstractCegarLoop]: === Iteration 187 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash 37188368, now seen corresponding path program 2 times [2021-11-07 02:32:35,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:35,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158115297] [2021-11-07 02:32:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:35,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:35,826 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 02:32:35,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:35,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158115297] [2021-11-07 02:32:35,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158115297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:35,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:35,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:32:35,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507379375] [2021-11-07 02:32:35,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:32:35,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:35,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:32:35,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:32:35,828 INFO L87 Difference]: Start difference. First operand 5979 states and 11983 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:39,658 INFO L93 Difference]: Finished difference Result 10693 states and 21207 transitions. [2021-11-07 02:32:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-07 02:32:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:39,673 INFO L225 Difference]: With dead ends: 10693 [2021-11-07 02:32:39,673 INFO L226 Difference]: Without dead ends: 10693 [2021-11-07 02:32:39,674 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=824, Invalid=2038, Unknown=0, NotChecked=0, Total=2862 [2021-11-07 02:32:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2021-11-07 02:32:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 5975. [2021-11-07 02:32:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5975 states, 5905 states have (on average 2.027942421676545) internal successors, (11975), 5974 states have internal predecessors, (11975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5975 states to 5975 states and 11975 transitions. [2021-11-07 02:32:39,780 INFO L78 Accepts]: Start accepts. Automaton has 5975 states and 11975 transitions. Word has length 30 [2021-11-07 02:32:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:39,780 INFO L470 AbstractCegarLoop]: Abstraction has 5975 states and 11975 transitions. [2021-11-07 02:32:39,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5975 states and 11975 transitions. [2021-11-07 02:32:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:39,781 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:39,781 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 02:32:39,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-11-07 02:32:39,782 INFO L402 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash -321242584, now seen corresponding path program 2 times [2021-11-07 02:32:39,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:39,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415930522] [2021-11-07 02:32:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:39,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:40,131 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 02:32:40,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:40,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415930522] [2021-11-07 02:32:40,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415930522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:40,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:40,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:40,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096262585] [2021-11-07 02:32:40,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:40,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:40,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:40,132 INFO L87 Difference]: Start difference. First operand 5975 states and 11975 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:43,068 INFO L93 Difference]: Finished difference Result 10382 states and 20589 transitions. [2021-11-07 02:32:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:32:43,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:43,082 INFO L225 Difference]: With dead ends: 10382 [2021-11-07 02:32:43,083 INFO L226 Difference]: Without dead ends: 10382 [2021-11-07 02:32:43,083 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:32:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2021-11-07 02:32:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 5979. [2021-11-07 02:32:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5979 states, 5909 states have (on average 2.027923506515485) internal successors, (11983), 5978 states have internal predecessors, (11983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 11983 transitions. [2021-11-07 02:32:43,217 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 11983 transitions. Word has length 30 [2021-11-07 02:32:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:43,217 INFO L470 AbstractCegarLoop]: Abstraction has 5979 states and 11983 transitions. [2021-11-07 02:32:43,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 11983 transitions. [2021-11-07 02:32:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:43,220 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:43,220 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 02:32:43,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-11-07 02:32:43,221 INFO L402 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1929890822, now seen corresponding path program 3 times [2021-11-07 02:32:43,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:43,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870396854] [2021-11-07 02:32:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:43,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:43,492 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 02:32:43,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:43,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870396854] [2021-11-07 02:32:43,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870396854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:43,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:43,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:43,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164890906] [2021-11-07 02:32:43,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:43,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:43,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:43,493 INFO L87 Difference]: Start difference. First operand 5979 states and 11983 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:46,251 INFO L93 Difference]: Finished difference Result 10396 states and 20617 transitions. [2021-11-07 02:32:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:32:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:46,267 INFO L225 Difference]: With dead ends: 10396 [2021-11-07 02:32:46,268 INFO L226 Difference]: Without dead ends: 10396 [2021-11-07 02:32:46,268 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:32:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10396 states. [2021-11-07 02:32:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10396 to 5983. [2021-11-07 02:32:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5913 states have (on average 2.0279046169457127) internal successors, (11991), 5982 states have internal predecessors, (11991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 11991 transitions. [2021-11-07 02:32:46,388 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 11991 transitions. Word has length 30 [2021-11-07 02:32:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:46,389 INFO L470 AbstractCegarLoop]: Abstraction has 5983 states and 11991 transitions. [2021-11-07 02:32:46,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 11991 transitions. [2021-11-07 02:32:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:46,390 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:46,390 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 02:32:46,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-11-07 02:32:46,390 INFO L402 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash -692532526, now seen corresponding path program 4 times [2021-11-07 02:32:46,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:46,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093631883] [2021-11-07 02:32:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:46,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:46,677 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 02:32:46,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:46,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093631883] [2021-11-07 02:32:46,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093631883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:46,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:46,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 02:32:46,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135918659] [2021-11-07 02:32:46,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:32:46,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:32:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:32:46,678 INFO L87 Difference]: Start difference. First operand 5983 states and 11991 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:50,299 INFO L93 Difference]: Finished difference Result 10410 states and 20645 transitions. [2021-11-07 02:32:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:32:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:50,313 INFO L225 Difference]: With dead ends: 10410 [2021-11-07 02:32:50,313 INFO L226 Difference]: Without dead ends: 10410 [2021-11-07 02:32:50,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:32:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2021-11-07 02:32:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 5987. [2021-11-07 02:32:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5987 states, 5917 states have (on average 2.0278857529153287) internal successors, (11999), 5986 states have internal predecessors, (11999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 11999 transitions. [2021-11-07 02:32:50,420 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 11999 transitions. Word has length 30 [2021-11-07 02:32:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:50,420 INFO L470 AbstractCegarLoop]: Abstraction has 5987 states and 11999 transitions. [2021-11-07 02:32:50,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 11999 transitions. [2021-11-07 02:32:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:50,422 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:50,422 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 02:32:50,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-11-07 02:32:50,422 INFO L402 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1173916038, now seen corresponding path program 5 times [2021-11-07 02:32:50,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:50,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327447866] [2021-11-07 02:32:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:50,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:50,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 02:32:50,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:50,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327447866] [2021-11-07 02:32:50,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327447866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:50,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:50,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:32:50,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692063104] [2021-11-07 02:32:50,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:32:50,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:32:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:32:50,591 INFO L87 Difference]: Start difference. First operand 5987 states and 11999 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:52,270 INFO L93 Difference]: Finished difference Result 9652 states and 19245 transitions. [2021-11-07 02:32:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:32:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:52,283 INFO L225 Difference]: With dead ends: 9652 [2021-11-07 02:32:52,283 INFO L226 Difference]: Without dead ends: 9652 [2021-11-07 02:32:52,284 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:32:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9652 states. [2021-11-07 02:32:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9652 to 6182. [2021-11-07 02:32:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6112 states have (on average 2.031413612565445) internal successors, (12416), 6181 states have internal predecessors, (12416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 12416 transitions. [2021-11-07 02:32:52,394 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 12416 transitions. Word has length 30 [2021-11-07 02:32:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:52,394 INFO L470 AbstractCegarLoop]: Abstraction has 6182 states and 12416 transitions. [2021-11-07 02:32:52,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 12416 transitions. [2021-11-07 02:32:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:52,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:52,395 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 02:32:52,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-11-07 02:32:52,396 INFO L402 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1700240477, now seen corresponding path program 1 times [2021-11-07 02:32:52,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:52,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974284591] [2021-11-07 02:32:52,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:52,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:53,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 02:32:53,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:53,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974284591] [2021-11-07 02:32:53,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974284591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:53,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:53,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:32:53,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768956785] [2021-11-07 02:32:53,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:32:53,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:53,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:32:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:32:53,006 INFO L87 Difference]: Start difference. First operand 6182 states and 12416 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:55,117 INFO L93 Difference]: Finished difference Result 10853 states and 21555 transitions. [2021-11-07 02:32:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:32:55,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:55,131 INFO L225 Difference]: With dead ends: 10853 [2021-11-07 02:32:55,131 INFO L226 Difference]: Without dead ends: 10853 [2021-11-07 02:32:55,131 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:32:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10853 states. [2021-11-07 02:32:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10853 to 6198. [2021-11-07 02:32:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6198 states, 6128 states have (on average 2.031331592689295) internal successors, (12448), 6197 states have internal predecessors, (12448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6198 states to 6198 states and 12448 transitions. [2021-11-07 02:32:55,240 INFO L78 Accepts]: Start accepts. Automaton has 6198 states and 12448 transitions. Word has length 30 [2021-11-07 02:32:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:55,240 INFO L470 AbstractCegarLoop]: Abstraction has 6198 states and 12448 transitions. [2021-11-07 02:32:55,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6198 states and 12448 transitions. [2021-11-07 02:32:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:55,242 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:55,242 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 02:32:55,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-11-07 02:32:55,243 INFO L402 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 373668719, now seen corresponding path program 2 times [2021-11-07 02:32:55,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:55,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262193653] [2021-11-07 02:32:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:55,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:55,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 02:32:55,822 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:55,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262193653] [2021-11-07 02:32:55,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262193653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:55,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:55,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:32:55,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281716757] [2021-11-07 02:32:55,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:32:55,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:32:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:32:55,823 INFO L87 Difference]: Start difference. First operand 6198 states and 12448 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:32:59,051 INFO L93 Difference]: Finished difference Result 10935 states and 21717 transitions. [2021-11-07 02:32:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:32:59,052 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:32:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:32:59,069 INFO L225 Difference]: With dead ends: 10935 [2021-11-07 02:32:59,069 INFO L226 Difference]: Without dead ends: 10935 [2021-11-07 02:32:59,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:32:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10935 states. [2021-11-07 02:32:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10935 to 6218. [2021-11-07 02:32:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6148 states have (on average 2.031392322706571) internal successors, (12489), 6217 states have internal predecessors, (12489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 12489 transitions. [2021-11-07 02:32:59,191 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 12489 transitions. Word has length 30 [2021-11-07 02:32:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:32:59,192 INFO L470 AbstractCegarLoop]: Abstraction has 6218 states and 12489 transitions. [2021-11-07 02:32:59,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:32:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 12489 transitions. [2021-11-07 02:32:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:32:59,193 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:32:59,193 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 02:32:59,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-11-07 02:32:59,193 INFO L402 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:32:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:32:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1864798499, now seen corresponding path program 3 times [2021-11-07 02:32:59,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:32:59,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283278248] [2021-11-07 02:32:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:32:59,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:32:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:32:59,889 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 02:32:59,889 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:32:59,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283278248] [2021-11-07 02:32:59,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283278248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:32:59,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:32:59,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:32:59,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058837694] [2021-11-07 02:32:59,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:32:59,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:32:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:32:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:32:59,890 INFO L87 Difference]: Start difference. First operand 6218 states and 12489 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:03,893 INFO L93 Difference]: Finished difference Result 11017 states and 21879 transitions. [2021-11-07 02:33:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:33:03,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:03,910 INFO L225 Difference]: With dead ends: 11017 [2021-11-07 02:33:03,911 INFO L226 Difference]: Without dead ends: 11017 [2021-11-07 02:33:03,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:33:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2021-11-07 02:33:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 6238. [2021-11-07 02:33:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6238 states, 6168 states have (on average 2.0314526588845654) internal successors, (12530), 6237 states have internal predecessors, (12530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6238 states to 6238 states and 12530 transitions. [2021-11-07 02:33:04,040 INFO L78 Accepts]: Start accepts. Automaton has 6238 states and 12530 transitions. Word has length 30 [2021-11-07 02:33:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:04,040 INFO L470 AbstractCegarLoop]: Abstraction has 6238 states and 12530 transitions. [2021-11-07 02:33:04,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 6238 states and 12530 transitions. [2021-11-07 02:33:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:04,042 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:04,042 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 02:33:04,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-11-07 02:33:04,042 INFO L402 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1474350097, now seen corresponding path program 4 times [2021-11-07 02:33:04,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:04,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568069393] [2021-11-07 02:33:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:04,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:04,563 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 02:33:04,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:04,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568069393] [2021-11-07 02:33:04,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568069393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:04,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:04,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-07 02:33:04,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095766948] [2021-11-07 02:33:04,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 02:33:04,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 02:33:04,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:33:04,565 INFO L87 Difference]: Start difference. First operand 6238 states and 12530 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:07,700 INFO L93 Difference]: Finished difference Result 11099 states and 22041 transitions. [2021-11-07 02:33:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:33:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:07,717 INFO L225 Difference]: With dead ends: 11099 [2021-11-07 02:33:07,717 INFO L226 Difference]: Without dead ends: 11099 [2021-11-07 02:33:07,718 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:33:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2021-11-07 02:33:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 6258. [2021-11-07 02:33:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6258 states, 6188 states have (on average 2.0315126050420167) internal successors, (12571), 6257 states have internal predecessors, (12571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 12571 transitions. [2021-11-07 02:33:07,843 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 12571 transitions. Word has length 30 [2021-11-07 02:33:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:07,843 INFO L470 AbstractCegarLoop]: Abstraction has 6258 states and 12571 transitions. [2021-11-07 02:33:07,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 12571 transitions. [2021-11-07 02:33:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:07,845 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:07,845 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 02:33:07,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-11-07 02:33:07,845 INFO L402 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:07,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash -21508189, now seen corresponding path program 5 times [2021-11-07 02:33:07,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:07,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92296229] [2021-11-07 02:33:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:07,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:08,210 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 02:33:08,210 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:08,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92296229] [2021-11-07 02:33:08,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92296229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:08,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:08,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:33:08,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298214110] [2021-11-07 02:33:08,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:33:08,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:08,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:33:08,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:33:08,211 INFO L87 Difference]: Start difference. First operand 6258 states and 12571 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:10,626 INFO L93 Difference]: Finished difference Result 15189 states and 30179 transitions. [2021-11-07 02:33:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:33:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:10,651 INFO L225 Difference]: With dead ends: 15189 [2021-11-07 02:33:10,652 INFO L226 Difference]: Without dead ends: 15189 [2021-11-07 02:33:10,652 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:33:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15189 states. [2021-11-07 02:33:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15189 to 6227. [2021-11-07 02:33:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6227 states, 6157 states have (on average 2.0290726002923503) internal successors, (12493), 6226 states have internal predecessors, (12493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 12493 transitions. [2021-11-07 02:33:10,798 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 12493 transitions. Word has length 30 [2021-11-07 02:33:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:10,798 INFO L470 AbstractCegarLoop]: Abstraction has 6227 states and 12493 transitions. [2021-11-07 02:33:10,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 12493 transitions. [2021-11-07 02:33:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:10,800 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:10,800 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 02:33:10,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-11-07 02:33:10,800 INFO L402 AbstractCegarLoop]: === Iteration 197 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash 712555945, now seen corresponding path program 1 times [2021-11-07 02:33:10,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:10,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503685937] [2021-11-07 02:33:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:10,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:10,958 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 02:33:10,958 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:10,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503685937] [2021-11-07 02:33:10,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503685937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:10,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:10,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:33:10,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335616678] [2021-11-07 02:33:10,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:33:10,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:33:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:33:10,959 INFO L87 Difference]: Start difference. First operand 6227 states and 12493 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:14,234 INFO L93 Difference]: Finished difference Result 14793 states and 29370 transitions. [2021-11-07 02:33:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-07 02:33:14,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:14,260 INFO L225 Difference]: With dead ends: 14793 [2021-11-07 02:33:14,260 INFO L226 Difference]: Without dead ends: 14793 [2021-11-07 02:33:14,260 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 02:33:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14793 states. [2021-11-07 02:33:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14793 to 6449. [2021-11-07 02:33:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6449 states, 6379 states have (on average 2.0271202382818623) internal successors, (12931), 6448 states have internal predecessors, (12931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6449 states to 6449 states and 12931 transitions. [2021-11-07 02:33:14,410 INFO L78 Accepts]: Start accepts. Automaton has 6449 states and 12931 transitions. Word has length 30 [2021-11-07 02:33:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:14,410 INFO L470 AbstractCegarLoop]: Abstraction has 6449 states and 12931 transitions. [2021-11-07 02:33:14,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6449 states and 12931 transitions. [2021-11-07 02:33:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:14,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:14,413 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 02:33:14,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-11-07 02:33:14,414 INFO L402 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -619256231, now seen corresponding path program 6 times [2021-11-07 02:33:14,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:14,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887208812] [2021-11-07 02:33:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:14,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:14,787 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 02:33:14,787 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:14,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887208812] [2021-11-07 02:33:14,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887208812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:14,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:14,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 02:33:14,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919289831] [2021-11-07 02:33:14,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:33:14,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:33:14,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:33:14,789 INFO L87 Difference]: Start difference. First operand 6449 states and 12931 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:17,257 INFO L93 Difference]: Finished difference Result 9914 states and 19675 transitions. [2021-11-07 02:33:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:33:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:17,272 INFO L225 Difference]: With dead ends: 9914 [2021-11-07 02:33:17,272 INFO L226 Difference]: Without dead ends: 9914 [2021-11-07 02:33:17,272 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2021-11-07 02:33:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2021-11-07 02:33:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 6394. [2021-11-07 02:33:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6394 states, 6324 states have (on average 2.0232447817836814) internal successors, (12795), 6393 states have internal predecessors, (12795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6394 states to 6394 states and 12795 transitions. [2021-11-07 02:33:17,427 INFO L78 Accepts]: Start accepts. Automaton has 6394 states and 12795 transitions. Word has length 30 [2021-11-07 02:33:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:17,428 INFO L470 AbstractCegarLoop]: Abstraction has 6394 states and 12795 transitions. [2021-11-07 02:33:17,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6394 states and 12795 transitions. [2021-11-07 02:33:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:17,429 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:17,429 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 02:33:17,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-11-07 02:33:17,430 INFO L402 AbstractCegarLoop]: === Iteration 199 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:17,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1487263953, now seen corresponding path program 2 times [2021-11-07 02:33:17,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:17,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730551503] [2021-11-07 02:33:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:17,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:17,601 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 02:33:17,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:17,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730551503] [2021-11-07 02:33:17,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730551503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:17,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:17,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:33:17,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823139204] [2021-11-07 02:33:17,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:33:17,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:33:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:33:17,603 INFO L87 Difference]: Start difference. First operand 6394 states and 12795 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:20,790 INFO L93 Difference]: Finished difference Result 9888 states and 19627 transitions. [2021-11-07 02:33:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 02:33:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:20,806 INFO L225 Difference]: With dead ends: 9888 [2021-11-07 02:33:20,806 INFO L226 Difference]: Without dead ends: 9888 [2021-11-07 02:33:20,806 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2021-11-07 02:33:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9888 states. [2021-11-07 02:33:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9888 to 6370. [2021-11-07 02:33:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6370 states, 6300 states have (on average 2.021746031746032) internal successors, (12737), 6369 states have internal predecessors, (12737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6370 states to 6370 states and 12737 transitions. [2021-11-07 02:33:20,925 INFO L78 Accepts]: Start accepts. Automaton has 6370 states and 12737 transitions. Word has length 30 [2021-11-07 02:33:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:20,925 INFO L470 AbstractCegarLoop]: Abstraction has 6370 states and 12737 transitions. [2021-11-07 02:33:20,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6370 states and 12737 transitions. [2021-11-07 02:33:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:20,927 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:20,927 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 02:33:20,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-11-07 02:33:20,927 INFO L402 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1661848786, now seen corresponding path program 6 times [2021-11-07 02:33:20,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:20,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123392097] [2021-11-07 02:33:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:20,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:21,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 02:33:21,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:21,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123392097] [2021-11-07 02:33:21,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123392097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:21,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:21,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:33:21,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334450040] [2021-11-07 02:33:21,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:33:21,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:33:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:33:21,112 INFO L87 Difference]: Start difference. First operand 6370 states and 12737 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:23,361 INFO L93 Difference]: Finished difference Result 9629 states and 19154 transitions. [2021-11-07 02:33:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:33:23,362 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:23,377 INFO L225 Difference]: With dead ends: 9629 [2021-11-07 02:33:23,377 INFO L226 Difference]: Without dead ends: 9629 [2021-11-07 02:33:23,377 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:33:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9629 states. [2021-11-07 02:33:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9629 to 6302. [2021-11-07 02:33:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6302 states, 6232 states have (on average 2.0219833119383823) internal successors, (12601), 6301 states have internal predecessors, (12601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6302 states to 6302 states and 12601 transitions. [2021-11-07 02:33:23,542 INFO L78 Accepts]: Start accepts. Automaton has 6302 states and 12601 transitions. Word has length 30 [2021-11-07 02:33:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:23,542 INFO L470 AbstractCegarLoop]: Abstraction has 6302 states and 12601 transitions. [2021-11-07 02:33:23,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6302 states and 12601 transitions. [2021-11-07 02:33:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:23,544 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:23,544 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 02:33:23,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-11-07 02:33:23,544 INFO L402 AbstractCegarLoop]: === Iteration 201 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:23,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash 949390249, now seen corresponding path program 1 times [2021-11-07 02:33:23,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:23,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046365304] [2021-11-07 02:33:23,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:23,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:24,409 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 02:33:24,409 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:24,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046365304] [2021-11-07 02:33:24,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046365304] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:24,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:24,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 02:33:24,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53035371] [2021-11-07 02:33:24,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 02:33:24,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 02:33:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-07 02:33:24,410 INFO L87 Difference]: Start difference. First operand 6302 states and 12601 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:28,922 INFO L93 Difference]: Finished difference Result 6645 states and 13237 transitions. [2021-11-07 02:33:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 02:33:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:28,933 INFO L225 Difference]: With dead ends: 6645 [2021-11-07 02:33:28,933 INFO L226 Difference]: Without dead ends: 6645 [2021-11-07 02:33:28,933 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2021-11-07 02:33:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2021-11-07 02:33:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 6326. [2021-11-07 02:33:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6326 states, 6256 states have (on average 2.021898976982097) internal successors, (12649), 6325 states have internal predecessors, (12649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 12649 transitions. [2021-11-07 02:33:29,034 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 12649 transitions. Word has length 30 [2021-11-07 02:33:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:29,035 INFO L470 AbstractCegarLoop]: Abstraction has 6326 states and 12649 transitions. [2021-11-07 02:33:29,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 12649 transitions. [2021-11-07 02:33:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:29,036 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:29,036 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 02:33:29,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-11-07 02:33:29,037 INFO L402 AbstractCegarLoop]: === Iteration 202 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1595278767, now seen corresponding path program 2 times [2021-11-07 02:33:29,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:29,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19318912] [2021-11-07 02:33:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:29,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:30,010 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 02:33:30,011 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:30,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19318912] [2021-11-07 02:33:30,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19318912] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:30,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:30,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 02:33:30,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642671993] [2021-11-07 02:33:30,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 02:33:30,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:30,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 02:33:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-07 02:33:30,012 INFO L87 Difference]: Start difference. First operand 6326 states and 12649 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:33,848 INFO L93 Difference]: Finished difference Result 6703 states and 13353 transitions. [2021-11-07 02:33:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 02:33:33,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:33,859 INFO L225 Difference]: With dead ends: 6703 [2021-11-07 02:33:33,859 INFO L226 Difference]: Without dead ends: 6703 [2021-11-07 02:33:33,859 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:33:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6703 states. [2021-11-07 02:33:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6703 to 6338. [2021-11-07 02:33:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6268 states have (on average 2.0218570516911294) internal successors, (12673), 6337 states have internal predecessors, (12673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 12673 transitions. [2021-11-07 02:33:33,957 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 12673 transitions. Word has length 30 [2021-11-07 02:33:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:33,958 INFO L470 AbstractCegarLoop]: Abstraction has 6338 states and 12673 transitions. [2021-11-07 02:33:33,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 12673 transitions. [2021-11-07 02:33:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:33,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:33,959 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 02:33:33,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-11-07 02:33:33,959 INFO L402 AbstractCegarLoop]: === Iteration 203 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash 948346163, now seen corresponding path program 3 times [2021-11-07 02:33:33,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:33,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106462321] [2021-11-07 02:33:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:33,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:34,832 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 02:33:34,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:34,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106462321] [2021-11-07 02:33:34,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106462321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:34,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:34,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 02:33:34,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158057235] [2021-11-07 02:33:34,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 02:33:34,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:34,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 02:33:34,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-07 02:33:34,833 INFO L87 Difference]: Start difference. First operand 6338 states and 12673 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:39,571 INFO L93 Difference]: Finished difference Result 6690 states and 13327 transitions. [2021-11-07 02:33:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:33:39,571 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:39,581 INFO L225 Difference]: With dead ends: 6690 [2021-11-07 02:33:39,581 INFO L226 Difference]: Without dead ends: 6690 [2021-11-07 02:33:39,581 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2021-11-07 02:33:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6690 states. [2021-11-07 02:33:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6690 to 6339. [2021-11-07 02:33:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6269 states have (on average 2.0218535651619076) internal successors, (12675), 6338 states have internal predecessors, (12675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 12675 transitions. [2021-11-07 02:33:39,679 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 12675 transitions. Word has length 30 [2021-11-07 02:33:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:39,679 INFO L470 AbstractCegarLoop]: Abstraction has 6339 states and 12675 transitions. [2021-11-07 02:33:39,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 12675 transitions. [2021-11-07 02:33:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:39,681 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:39,681 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 02:33:39,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-11-07 02:33:39,681 INFO L402 AbstractCegarLoop]: === Iteration 204 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1440092731, now seen corresponding path program 4 times [2021-11-07 02:33:39,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:39,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350749974] [2021-11-07 02:33:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:39,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:40,489 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 02:33:40,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:40,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350749974] [2021-11-07 02:33:40,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350749974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:40,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:40,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 02:33:40,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898844487] [2021-11-07 02:33:40,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 02:33:40,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 02:33:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-07 02:33:40,490 INFO L87 Difference]: Start difference. First operand 6339 states and 12675 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:45,246 INFO L93 Difference]: Finished difference Result 6721 states and 13389 transitions. [2021-11-07 02:33:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:33:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:45,256 INFO L225 Difference]: With dead ends: 6721 [2021-11-07 02:33:45,256 INFO L226 Difference]: Without dead ends: 6721 [2021-11-07 02:33:45,256 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2021-11-07 02:33:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2021-11-07 02:33:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6353. [2021-11-07 02:33:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6353 states, 6283 states have (on average 2.0218048702848956) internal successors, (12703), 6352 states have internal predecessors, (12703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6353 states to 6353 states and 12703 transitions. [2021-11-07 02:33:45,350 INFO L78 Accepts]: Start accepts. Automaton has 6353 states and 12703 transitions. Word has length 30 [2021-11-07 02:33:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:45,351 INFO L470 AbstractCegarLoop]: Abstraction has 6353 states and 12703 transitions. [2021-11-07 02:33:45,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 6353 states and 12703 transitions. [2021-11-07 02:33:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:45,352 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:45,352 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 02:33:45,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-11-07 02:33:45,352 INFO L402 AbstractCegarLoop]: === Iteration 205 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2022926703, now seen corresponding path program 5 times [2021-11-07 02:33:45,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:45,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691739214] [2021-11-07 02:33:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:45,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:46,144 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 02:33:46,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:46,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691739214] [2021-11-07 02:33:46,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691739214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:46,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:46,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 02:33:46,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517708759] [2021-11-07 02:33:46,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 02:33:46,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 02:33:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-07 02:33:46,146 INFO L87 Difference]: Start difference. First operand 6353 states and 12703 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:33:49,475 INFO L93 Difference]: Finished difference Result 6731 states and 13410 transitions. [2021-11-07 02:33:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:33:49,475 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:33:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:33:49,485 INFO L225 Difference]: With dead ends: 6731 [2021-11-07 02:33:49,485 INFO L226 Difference]: Without dead ends: 6731 [2021-11-07 02:33:49,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2021-11-07 02:33:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6731 states. [2021-11-07 02:33:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6731 to 6377. [2021-11-07 02:33:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6377 states, 6307 states have (on average 2.021721896305692) internal successors, (12751), 6376 states have internal predecessors, (12751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6377 states to 6377 states and 12751 transitions. [2021-11-07 02:33:49,582 INFO L78 Accepts]: Start accepts. Automaton has 6377 states and 12751 transitions. Word has length 30 [2021-11-07 02:33:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:33:49,583 INFO L470 AbstractCegarLoop]: Abstraction has 6377 states and 12751 transitions. [2021-11-07 02:33:49,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:33:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6377 states and 12751 transitions. [2021-11-07 02:33:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:33:49,584 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:33:49,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, 1, 1, 1, 1, 1, 1] [2021-11-07 02:33:49,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-11-07 02:33:49,584 INFO L402 AbstractCegarLoop]: === Iteration 206 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2021-11-07 02:33:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:33:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1375994099, now seen corresponding path program 6 times [2021-11-07 02:33:49,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:33:49,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890313611] [2021-11-07 02:33:49,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:33:49,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:33:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:33:50,451 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 02:33:50,451 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:33:50,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890313611] [2021-11-07 02:33:50,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890313611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:33:50,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:33:50,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 02:33:50,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388617872] [2021-11-07 02:33:50,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 02:33:50,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:33:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 02:33:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-07 02:33:50,453 INFO L87 Difference]: Start difference. First operand 6377 states and 12751 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)