./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9 --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 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:20:26,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:20:26,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:20:26,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:20:26,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:20:26,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:20:26,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:20:26,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:20:26,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:20:26,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:20:26,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:20:26,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:20:26,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:20:26,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:20:26,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:20:26,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:20:26,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:20:26,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:20:26,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:20:26,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:20:26,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:20:26,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:20:26,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:20:26,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:20:26,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:20:26,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:20:26,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:20:26,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:20:26,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:20:26,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:20:26,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:20:26,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:20:26,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:20:26,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:20:26,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:20:26,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:20:26,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:20:26,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:20:26,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:20:26,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:20:26,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:20:26,705 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-20 20:20:26,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:20:26,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:20:26,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:20:26,746 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:20:26,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:20:26,747 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:20:26,747 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:20:26,748 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:20:26,748 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:20:26,748 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:20:26,749 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:20:26,749 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:20:26,749 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:20:26,750 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:20:26,750 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:20:26,750 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:20:26,750 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:20:26,750 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:20:26,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:20:26,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:20:26,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:20:26,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:20:26,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:20:26,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:20:26,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:20:26,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:20:26,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:20:26,753 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 20:20:26,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:20:26,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:20:26,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:20:26,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:20:26,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:20:26,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:20:26,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:20:26,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:20:26,755 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:20:26,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:20:26,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:20:26,755 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:20:26,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:20:26,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:20:26,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:20:26,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/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_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2022-11-20 20:20:27,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:20:27,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:20:27,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:20:27,092 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:20:27,092 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:20:27,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2022-11-20 20:20:30,095 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:20:30,466 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:20:30,470 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2022-11-20 20:20:30,495 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/data/e39667681/ca72286da454410d895b8351632be7bb/FLAGf694b46ec [2022-11-20 20:20:30,517 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/data/e39667681/ca72286da454410d895b8351632be7bb [2022-11-20 20:20:30,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:20:30,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:20:30,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:20:30,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:20:30,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:20:30,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:20:30" (1/1) ... [2022-11-20 20:20:30,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35371a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:30, skipping insertion in model container [2022-11-20 20:20:30,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:20:30" (1/1) ... [2022-11-20 20:20:30,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:20:30,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:20:31,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:20:31,358 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:20:31,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:20:31,610 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:20:31,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31 WrapperNode [2022-11-20 20:20:31,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:20:31,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:20:31,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:20:31,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:20:31,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,703 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174 [2022-11-20 20:20:31,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:20:31,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:20:31,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:20:31,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:20:31,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,742 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:20:31,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:20:31,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:20:31,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:20:31,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (1/1) ... [2022-11-20 20:20:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:20:31,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:20:31,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:20:31,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:20:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:20:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:20:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:20:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:20:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:20:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 20:20:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:20:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:20:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:20:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-20 20:20:31,851 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-20 20:20:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:20:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:20:31,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:20:31,853 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:20:32,047 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:20:32,049 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:20:32,639 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:20:32,650 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:20:32,650 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 20:20:32,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:20:32 BoogieIcfgContainer [2022-11-20 20:20:32,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:20:32,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:20:32,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:20:32,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:20:32,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:20:30" (1/3) ... [2022-11-20 20:20:32,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d56521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:20:32, skipping insertion in model container [2022-11-20 20:20:32,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:20:31" (2/3) ... [2022-11-20 20:20:32,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d56521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:20:32, skipping insertion in model container [2022-11-20 20:20:32,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:20:32" (3/3) ... [2022-11-20 20:20:32,663 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2022-11-20 20:20:32,672 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 20:20:32,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:20:32,684 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-20 20:20:32,684 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:20:32,825 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 20:20:32,867 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:20:32,883 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 276 transitions, 557 flow [2022-11-20 20:20:32,886 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 276 transitions, 557 flow [2022-11-20 20:20:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 557 flow [2022-11-20 20:20:33,072 INFO L130 PetriNetUnfolder]: 0/275 cut-off events. [2022-11-20 20:20:33,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 20:20:33,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-11-20 20:20:33,088 INFO L119 LiptonReduction]: Number of co-enabled transitions 7728 [2022-11-20 20:21:15,330 WARN L233 SmtUtils]: Spent 14.60s on a formula simplification. DAG size of input: 139 DAG size of output: 137 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:21:31,671 WARN L233 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 139 DAG size of output: 137 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:21:43,397 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:21:49,107 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:21:56,145 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:22:24,071 WARN L233 SmtUtils]: Spent 23.17s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:22:45,111 WARN L233 SmtUtils]: Spent 21.04s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:22:57,302 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:23:18,192 WARN L233 SmtUtils]: Spent 20.89s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:23:31,699 WARN L233 SmtUtils]: Spent 13.49s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:23:46,787 WARN L233 SmtUtils]: Spent 15.08s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:24:07,584 WARN L233 SmtUtils]: Spent 20.79s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:24:21,535 WARN L233 SmtUtils]: Spent 13.95s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:27:16,974 WARN L233 SmtUtils]: Spent 2.92m on a formula simplification that was a NOOP. DAG size: 370 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:28:49,070 WARN L233 SmtUtils]: Spent 1.53m on a formula simplification that was a NOOP. DAG size: 329 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:30:34,591 WARN L233 SmtUtils]: Spent 1.76m on a formula simplification that was a NOOP. DAG size: 370 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:31:53,780 WARN L233 SmtUtils]: Spent 1.32m on a formula simplification that was a NOOP. DAG size: 329 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:31:54,127 INFO L134 LiptonReduction]: Checked pairs total: 102063 [2022-11-20 20:31:54,127 INFO L136 LiptonReduction]: Total number of compositions: 288 [2022-11-20 20:31:54,135 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 91 transitions, 187 flow [2022-11-20 20:31:54,214 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1447 states, 1371 states have (on average 2.0437636761487963) internal successors, (2802), 1446 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:31:54,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:31:54,238 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@692afc47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:31:54,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-11-20 20:31:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 1447 states, 1371 states have (on average 2.0437636761487963) internal successors, (2802), 1446 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:31:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 20:31:54,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:31:54,249 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 20:31:54,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:31:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:31:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 927, now seen corresponding path program 1 times [2022-11-20 20:31:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:31:54,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775550795] [2022-11-20 20:31:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:31:54,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:31:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:31:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:31:54,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:31:54,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775550795] [2022-11-20 20:31:54,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775550795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:31:54,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:31:54,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 20:31:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494475193] [2022-11-20 20:31:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:31:54,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 20:31:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:31:54,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 20:31:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:31:54,444 INFO L87 Difference]: Start difference. First operand has 1447 states, 1371 states have (on average 2.0437636761487963) internal successors, (2802), 1446 states have internal predecessors, (2802), 0 states have call successors, (0), 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) [2022-11-20 20:31:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:31:55,038 INFO L93 Difference]: Finished difference Result 1285 states and 2496 transitions. [2022-11-20 20:31:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 20:31:55,045 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 [2022-11-20 20:31:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:31:55,072 INFO L225 Difference]: With dead ends: 1285 [2022-11-20 20:31:55,079 INFO L226 Difference]: Without dead ends: 1285 [2022-11-20 20:31:55,080 INFO L412 NwaCegarLoop]: 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 [2022-11-20 20:31:55,084 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:31:55,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 20:31:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2022-11-20 20:31:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2022-11-20 20:31:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1251 states have (on average 1.9952038369304557) internal successors, (2496), 1284 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:31:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2496 transitions. [2022-11-20 20:31:55,245 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2496 transitions. Word has length 1 [2022-11-20 20:31:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:31:55,249 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 2496 transitions. [2022-11-20 20:31:55,250 INFO L496 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) [2022-11-20 20:31:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2496 transitions. [2022-11-20 20:31:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:31:55,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:31:55,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:31:55,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:31:55,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:31:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:31:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1927758261, now seen corresponding path program 1 times [2022-11-20 20:31:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:31:55,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116056674] [2022-11-20 20:31:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:31:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:31:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:31:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:31:56,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:31:56,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116056674] [2022-11-20 20:31:56,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116056674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:31:56,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:31:56,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:31:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541676867] [2022-11-20 20:31:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:31:56,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:31:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:31:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:31:56,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:31:56,280 INFO L87 Difference]: Start difference. First operand 1285 states and 2496 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:31:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:31:58,615 INFO L93 Difference]: Finished difference Result 2028 states and 3927 transitions. [2022-11-20 20:31:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:31:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 20:31:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:31:58,630 INFO L225 Difference]: With dead ends: 2028 [2022-11-20 20:31:58,630 INFO L226 Difference]: Without dead ends: 2028 [2022-11-20 20:31:58,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:31:58,632 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:31:58,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 29 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-20 20:31:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-11-20 20:31:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1252. [2022-11-20 20:31:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1223 states have (on average 1.9877350776778413) internal successors, (2431), 1251 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:31:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2431 transitions. [2022-11-20 20:31:58,679 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2431 transitions. Word has length 7 [2022-11-20 20:31:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:31:58,680 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 2431 transitions. [2022-11-20 20:31:58,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:31:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2431 transitions. [2022-11-20 20:31:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:31:58,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:31:58,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:31:58,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:31:58,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:31:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:31:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -432244872, now seen corresponding path program 1 times [2022-11-20 20:31:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:31:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73116304] [2022-11-20 20:31:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:31:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:31:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:31:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:31:59,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:31:59,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73116304] [2022-11-20 20:31:59,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73116304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:31:59,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:31:59,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:31:59,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967481605] [2022-11-20 20:31:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:31:59,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:31:59,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:31:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:31:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:31:59,425 INFO L87 Difference]: Start difference. First operand 1252 states and 2431 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) [2022-11-20 20:32:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:02,003 INFO L93 Difference]: Finished difference Result 1990 states and 3852 transitions. [2022-11-20 20:32:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:32:02,004 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 [2022-11-20 20:32:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:02,013 INFO L225 Difference]: With dead ends: 1990 [2022-11-20 20:32:02,013 INFO L226 Difference]: Without dead ends: 1990 [2022-11-20 20:32:02,013 INFO L412 NwaCegarLoop]: 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 [2022-11-20 20:32:02,025 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:02,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 36 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 20:32:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2022-11-20 20:32:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1344. [2022-11-20 20:32:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1316 states have (on average 1.9840425531914894) internal successors, (2611), 1343 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2611 transitions. [2022-11-20 20:32:02,069 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2611 transitions. Word has length 9 [2022-11-20 20:32:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:02,069 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 2611 transitions. [2022-11-20 20:32:02,069 INFO L496 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) [2022-11-20 20:32:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2611 transitions. [2022-11-20 20:32:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:32:02,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:02,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:02,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:32:02,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1039173218, now seen corresponding path program 1 times [2022-11-20 20:32:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298378880] [2022-11-20 20:32:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:02,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:02,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298378880] [2022-11-20 20:32:02,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298378880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:02,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:02,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:32:02,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361771187] [2022-11-20 20:32:02,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:02,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:32:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:02,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:32:02,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:32:02,541 INFO L87 Difference]: Start difference. First operand 1344 states and 2611 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:04,537 INFO L93 Difference]: Finished difference Result 1312 states and 2548 transitions. [2022-11-20 20:32:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:32:04,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 20:32:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:04,543 INFO L225 Difference]: With dead ends: 1312 [2022-11-20 20:32:04,544 INFO L226 Difference]: Without dead ends: 1312 [2022-11-20 20:32:04,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:32:04,547 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 47 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:04,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 56 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-20 20:32:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-11-20 20:32:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2022-11-20 20:32:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1288 states have (on average 1.9782608695652173) internal successors, (2548), 1311 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2548 transitions. [2022-11-20 20:32:04,589 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2548 transitions. Word has length 11 [2022-11-20 20:32:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:04,589 INFO L495 AbstractCegarLoop]: Abstraction has 1312 states and 2548 transitions. [2022-11-20 20:32:04,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2548 transitions. [2022-11-20 20:32:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:32:04,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:04,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:04,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:32:04,598 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash 755985668, now seen corresponding path program 1 times [2022-11-20 20:32:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:04,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270461378] [2022-11-20 20:32:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:05,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:05,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270461378] [2022-11-20 20:32:05,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270461378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:05,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:05,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:32:05,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72819127] [2022-11-20 20:32:05,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:05,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:32:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:05,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:32:05,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:32:05,165 INFO L87 Difference]: Start difference. First operand 1312 states and 2548 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) [2022-11-20 20:32:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:07,423 INFO L93 Difference]: Finished difference Result 1780 states and 3439 transitions. [2022-11-20 20:32:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:32:07,427 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 [2022-11-20 20:32:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:07,433 INFO L225 Difference]: With dead ends: 1780 [2022-11-20 20:32:07,434 INFO L226 Difference]: Without dead ends: 1768 [2022-11-20 20:32:07,434 INFO L412 NwaCegarLoop]: 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 [2022-11-20 20:32:07,435 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:07,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 43 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 20:32:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2022-11-20 20:32:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1486. [2022-11-20 20:32:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1462 states have (on average 1.9740082079343366) internal successors, (2886), 1485 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2886 transitions. [2022-11-20 20:32:07,477 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2886 transitions. Word has length 15 [2022-11-20 20:32:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:07,477 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 2886 transitions. [2022-11-20 20:32:07,477 INFO L496 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) [2022-11-20 20:32:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2886 transitions. [2022-11-20 20:32:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:32:07,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:07,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:07,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:32:07,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash 651480730, now seen corresponding path program 1 times [2022-11-20 20:32:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:07,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870470064] [2022-11-20 20:32:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:08,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:08,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870470064] [2022-11-20 20:32:08,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870470064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:08,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:08,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:32:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249392969] [2022-11-20 20:32:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:08,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:32:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:32:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:32:08,066 INFO L87 Difference]: Start difference. First operand 1486 states and 2886 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:09,914 INFO L93 Difference]: Finished difference Result 1600 states and 3110 transitions. [2022-11-20 20:32:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:32:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 20:32:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:09,942 INFO L225 Difference]: With dead ends: 1600 [2022-11-20 20:32:09,942 INFO L226 Difference]: Without dead ends: 1600 [2022-11-20 20:32:09,943 INFO L412 NwaCegarLoop]: 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 [2022-11-20 20:32:09,944 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:09,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 20:32:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-11-20 20:32:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2022-11-20 20:32:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1576 states have (on average 1.9733502538071066) internal successors, (3110), 1599 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3110 transitions. [2022-11-20 20:32:09,991 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3110 transitions. Word has length 17 [2022-11-20 20:32:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:09,991 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 3110 transitions. [2022-11-20 20:32:09,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3110 transitions. [2022-11-20 20:32:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:32:09,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:09,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:09,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:32:09,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1378712825, now seen corresponding path program 1 times [2022-11-20 20:32:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:09,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305850229] [2022-11-20 20:32:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:09,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:10,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305850229] [2022-11-20 20:32:10,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305850229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:10,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:10,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:32:10,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555810074] [2022-11-20 20:32:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:10,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:32:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:32:10,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:32:10,170 INFO L87 Difference]: Start difference. First operand 1600 states and 3110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:11,459 INFO L93 Difference]: Finished difference Result 1167 states and 2188 transitions. [2022-11-20 20:32:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:32:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 20:32:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:11,464 INFO L225 Difference]: With dead ends: 1167 [2022-11-20 20:32:11,465 INFO L226 Difference]: Without dead ends: 1167 [2022-11-20 20:32:11,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:32:11,466 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 59 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:11,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 20:32:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-11-20 20:32:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1139. [2022-11-20 20:32:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1121 states have (on average 1.926851025869759) internal successors, (2160), 1138 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2160 transitions. [2022-11-20 20:32:11,493 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2160 transitions. Word has length 20 [2022-11-20 20:32:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:11,493 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 2160 transitions. [2022-11-20 20:32:11,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2160 transitions. [2022-11-20 20:32:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:32:11,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:11,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:11,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:32:11,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1809069743, now seen corresponding path program 1 times [2022-11-20 20:32:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273602022] [2022-11-20 20:32:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:12,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:12,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273602022] [2022-11-20 20:32:12,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273602022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:12,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:12,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:32:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076279165] [2022-11-20 20:32:12,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:12,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:32:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:12,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:32:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:32:12,069 INFO L87 Difference]: Start difference. First operand 1139 states and 2160 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:14,282 INFO L93 Difference]: Finished difference Result 1292 states and 2430 transitions. [2022-11-20 20:32:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:32:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 20:32:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:14,288 INFO L225 Difference]: With dead ends: 1292 [2022-11-20 20:32:14,288 INFO L226 Difference]: Without dead ends: 1250 [2022-11-20 20:32:14,288 INFO L412 NwaCegarLoop]: 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 [2022-11-20 20:32:14,289 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:14,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 56 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 20:32:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-11-20 20:32:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1116. [2022-11-20 20:32:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1101 states have (on average 1.9073569482288828) internal successors, (2100), 1115 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2100 transitions. [2022-11-20 20:32:14,337 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 2100 transitions. Word has length 23 [2022-11-20 20:32:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:14,337 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 2100 transitions. [2022-11-20 20:32:14,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 2100 transitions. [2022-11-20 20:32:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:32:14,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:14,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:14,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:32:14,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash -359166801, now seen corresponding path program 1 times [2022-11-20 20:32:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:14,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71391765] [2022-11-20 20:32:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:14,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:14,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71391765] [2022-11-20 20:32:14,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71391765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:14,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:14,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:32:14,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994071888] [2022-11-20 20:32:14,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:14,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:32:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:14,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:32:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:32:14,802 INFO L87 Difference]: Start difference. First operand 1116 states and 2100 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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) [2022-11-20 20:32:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:16,491 INFO L93 Difference]: Finished difference Result 1081 states and 2032 transitions. [2022-11-20 20:32:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:32:16,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 [2022-11-20 20:32:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:16,496 INFO L225 Difference]: With dead ends: 1081 [2022-11-20 20:32:16,496 INFO L226 Difference]: Without dead ends: 1081 [2022-11-20 20:32:16,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:32:16,497 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:16,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 58 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-20 20:32:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-11-20 20:32:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2022-11-20 20:32:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.900841908325538) internal successors, (2032), 1080 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 2032 transitions. [2022-11-20 20:32:16,524 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 2032 transitions. Word has length 27 [2022-11-20 20:32:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:16,524 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 2032 transitions. [2022-11-20 20:32:16,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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) [2022-11-20 20:32:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 2032 transitions. [2022-11-20 20:32:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 20:32:16,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:16,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:16,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:32:16,526 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1552923190, now seen corresponding path program 1 times [2022-11-20 20:32:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:16,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623687868] [2022-11-20 20:32:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:17,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:17,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623687868] [2022-11-20 20:32:17,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623687868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:17,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:17,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:32:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901742948] [2022-11-20 20:32:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:17,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:32:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:32:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:32:17,147 INFO L87 Difference]: Start difference. First operand 1081 states and 2032 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:18,976 INFO L93 Difference]: Finished difference Result 1194 states and 2244 transitions. [2022-11-20 20:32:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:32:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-20 20:32:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:18,981 INFO L225 Difference]: With dead ends: 1194 [2022-11-20 20:32:18,982 INFO L226 Difference]: Without dead ends: 1132 [2022-11-20 20:32:18,982 INFO L412 NwaCegarLoop]: 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 [2022-11-20 20:32:18,983 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:18,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 60 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 20:32:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-11-20 20:32:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2022-11-20 20:32:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1120 states have (on average 1.8821428571428571) internal successors, (2108), 1131 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2108 transitions. [2022-11-20 20:32:19,010 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2108 transitions. Word has length 33 [2022-11-20 20:32:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:19,010 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 2108 transitions. [2022-11-20 20:32:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2108 transitions. [2022-11-20 20:32:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:32:19,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:19,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:19,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:32:19,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1881511640, now seen corresponding path program 1 times [2022-11-20 20:32:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:19,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596082454] [2022-11-20 20:32:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:20,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:20,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596082454] [2022-11-20 20:32:20,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596082454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:20,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:20,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:32:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017063563] [2022-11-20 20:32:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:20,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:32:20,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:20,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:32:20,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:32:20,935 INFO L87 Difference]: Start difference. First operand 1132 states and 2108 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:23,558 INFO L93 Difference]: Finished difference Result 1258 states and 2345 transitions. [2022-11-20 20:32:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:32:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 20:32:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:23,562 INFO L225 Difference]: With dead ends: 1258 [2022-11-20 20:32:23,562 INFO L226 Difference]: Without dead ends: 1258 [2022-11-20 20:32:23,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2022-11-20 20:32:23,563 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 159 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:23,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 53 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-20 20:32:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2022-11-20 20:32:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1183. [2022-11-20 20:32:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1171 states have (on average 1.8898377455166524) internal successors, (2213), 1182 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2213 transitions. [2022-11-20 20:32:23,591 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 2213 transitions. Word has length 34 [2022-11-20 20:32:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:23,591 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 2213 transitions. [2022-11-20 20:32:23,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 2213 transitions. [2022-11-20 20:32:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:32:23,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:23,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:23,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 20:32:23,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash 33330476, now seen corresponding path program 1 times [2022-11-20 20:32:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:23,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325251868] [2022-11-20 20:32:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:25,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:25,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325251868] [2022-11-20 20:32:25,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325251868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:25,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:25,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 20:32:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373494966] [2022-11-20 20:32:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:25,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:32:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:25,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:32:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:32:25,343 INFO L87 Difference]: Start difference. First operand 1183 states and 2213 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:28,310 INFO L93 Difference]: Finished difference Result 1173 states and 2190 transitions. [2022-11-20 20:32:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:32:28,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 20:32:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:28,315 INFO L225 Difference]: With dead ends: 1173 [2022-11-20 20:32:28,315 INFO L226 Difference]: Without dead ends: 1173 [2022-11-20 20:32:28,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:32:28,317 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 148 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:28,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 77 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-20 20:32:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-11-20 20:32:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1133. [2022-11-20 20:32:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-20 20:32:28,344 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-20 20:32:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:28,344 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-20 20:32:28,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-20 20:32:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:32:28,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:28,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:28,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 20:32:28,349 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1274134364, now seen corresponding path program 2 times [2022-11-20 20:32:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:28,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354767390] [2022-11-20 20:32:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:30,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354767390] [2022-11-20 20:32:30,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354767390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:30,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:30,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:32:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658178354] [2022-11-20 20:32:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:30,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:32:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:30,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:32:30,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:32:30,019 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:32,604 INFO L93 Difference]: Finished difference Result 1452 states and 2692 transitions. [2022-11-20 20:32:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 20:32:32,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 20:32:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:32,612 INFO L225 Difference]: With dead ends: 1452 [2022-11-20 20:32:32,613 INFO L226 Difference]: Without dead ends: 1452 [2022-11-20 20:32:32,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:32:32,613 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 47 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:32,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 69 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 20:32:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2022-11-20 20:32:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1133. [2022-11-20 20:32:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-20 20:32:32,641 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-20 20:32:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:32,642 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-20 20:32:32,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-20 20:32:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:32:32,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:32,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:32,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 20:32:32,644 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1261741936, now seen corresponding path program 3 times [2022-11-20 20:32:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:32,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165213412] [2022-11-20 20:32:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:34,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165213412] [2022-11-20 20:32:34,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165213412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:34,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:34,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 20:32:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755764425] [2022-11-20 20:32:34,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:34,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:32:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:32:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:32:34,771 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:38,969 INFO L93 Difference]: Finished difference Result 1484 states and 2756 transitions. [2022-11-20 20:32:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:32:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 20:32:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:38,974 INFO L225 Difference]: With dead ends: 1484 [2022-11-20 20:32:38,975 INFO L226 Difference]: Without dead ends: 1484 [2022-11-20 20:32:38,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-11-20 20:32:38,976 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 96 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:38,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 64 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-20 20:32:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2022-11-20 20:32:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1133. [2022-11-20 20:32:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-20 20:32:39,028 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-20 20:32:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:39,029 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-20 20:32:39,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-20 20:32:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:32:39,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:39,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:39,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 20:32:39,031 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash -339902620, now seen corresponding path program 4 times [2022-11-20 20:32:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:39,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952252474] [2022-11-20 20:32:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:40,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:40,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952252474] [2022-11-20 20:32:40,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952252474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:40,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:40,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:32:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104560886] [2022-11-20 20:32:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:40,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:32:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:32:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:32:40,588 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:44,873 INFO L93 Difference]: Finished difference Result 1502 states and 2792 transitions. [2022-11-20 20:32:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:32:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 20:32:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:44,878 INFO L225 Difference]: With dead ends: 1502 [2022-11-20 20:32:44,878 INFO L226 Difference]: Without dead ends: 1502 [2022-11-20 20:32:44,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-20 20:32:44,879 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 52 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:44,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 80 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-20 20:32:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-11-20 20:32:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1133. [2022-11-20 20:32:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-20 20:32:44,907 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-20 20:32:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:44,907 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-20 20:32:44,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-20 20:32:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:32:44,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:44,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:44,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 20:32:44,909 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash 640605290, now seen corresponding path program 5 times [2022-11-20 20:32:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:44,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702771422] [2022-11-20 20:32:44,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:46,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:46,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702771422] [2022-11-20 20:32:46,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702771422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:46,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:46,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:32:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744861099] [2022-11-20 20:32:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:46,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:32:46,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:32:46,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 20:32:46,264 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:50,191 INFO L93 Difference]: Finished difference Result 1472 states and 2732 transitions. [2022-11-20 20:32:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:32:50,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 20:32:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:50,202 INFO L225 Difference]: With dead ends: 1472 [2022-11-20 20:32:50,203 INFO L226 Difference]: Without dead ends: 1472 [2022-11-20 20:32:50,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:32:50,204 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 60 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:50,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 77 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-20 20:32:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-11-20 20:32:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1077. [2022-11-20 20:32:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1066 states have (on average 1.874296435272045) internal successors, (1998), 1076 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1998 transitions. [2022-11-20 20:32:50,233 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1998 transitions. Word has length 34 [2022-11-20 20:32:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:50,233 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1998 transitions. [2022-11-20 20:32:50,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1998 transitions. [2022-11-20 20:32:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 20:32:50,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:50,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:50,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 20:32:50,235 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 622573053, now seen corresponding path program 1 times [2022-11-20 20:32:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:50,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784723698] [2022-11-20 20:32:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:52,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784723698] [2022-11-20 20:32:52,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784723698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:52,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:52,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 20:32:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648465688] [2022-11-20 20:32:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:52,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:32:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:52,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:32:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:32:52,071 INFO L87 Difference]: Start difference. First operand 1077 states and 1998 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:32:55,825 INFO L93 Difference]: Finished difference Result 1477 states and 2744 transitions. [2022-11-20 20:32:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:32:55,826 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 20:32:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:32:55,829 INFO L225 Difference]: With dead ends: 1477 [2022-11-20 20:32:55,830 INFO L226 Difference]: Without dead ends: 1475 [2022-11-20 20:32:55,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-11-20 20:32:55,831 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 271 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:32:55,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 51 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-20 20:32:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2022-11-20 20:32:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1128. [2022-11-20 20:32:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1117 states have (on average 1.8818263205013428) internal successors, (2102), 1127 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2102 transitions. [2022-11-20 20:32:55,856 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2102 transitions. Word has length 36 [2022-11-20 20:32:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:32:55,856 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 2102 transitions. [2022-11-20 20:32:55,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:32:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2102 transitions. [2022-11-20 20:32:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 20:32:55,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:32:55,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:32:55,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 20:32:55,858 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:32:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:32:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash 531358594, now seen corresponding path program 1 times [2022-11-20 20:32:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:32:55,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683274264] [2022-11-20 20:32:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:32:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:32:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:32:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:32:57,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:32:57,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683274264] [2022-11-20 20:32:57,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683274264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:32:57,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:32:57,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 20:32:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130897969] [2022-11-20 20:32:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:32:57,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:32:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:32:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:32:57,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:32:57,149 INFO L87 Difference]: Start difference. First operand 1128 states and 2102 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:33:00,337 INFO L93 Difference]: Finished difference Result 1118 states and 2079 transitions. [2022-11-20 20:33:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:33:00,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 20:33:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:33:00,340 INFO L225 Difference]: With dead ends: 1118 [2022-11-20 20:33:00,341 INFO L226 Difference]: Without dead ends: 1118 [2022-11-20 20:33:00,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-20 20:33:00,342 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 244 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:33:00,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 155 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-20 20:33:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-11-20 20:33:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1078. [2022-11-20 20:33:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1068 states have (on average 1.8745318352059925) internal successors, (2002), 1077 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2002 transitions. [2022-11-20 20:33:00,365 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2002 transitions. Word has length 36 [2022-11-20 20:33:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:33:00,365 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 2002 transitions. [2022-11-20 20:33:00,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2002 transitions. [2022-11-20 20:33:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 20:33:00,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:33:00,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:33:00,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 20:33:00,367 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:33:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:33:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1135975549, now seen corresponding path program 2 times [2022-11-20 20:33:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:33:00,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770259395] [2022-11-20 20:33:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:33:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:33:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:33:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:33:02,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:33:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770259395] [2022-11-20 20:33:02,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770259395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:33:02,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:33:02,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 20:33:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256958972] [2022-11-20 20:33:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:33:02,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:33:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:33:02,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:33:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:33:02,243 INFO L87 Difference]: Start difference. First operand 1078 states and 2002 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:33:06,910 INFO L93 Difference]: Finished difference Result 1072 states and 1991 transitions. [2022-11-20 20:33:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:33:06,911 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 20:33:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:33:06,913 INFO L225 Difference]: With dead ends: 1072 [2022-11-20 20:33:06,913 INFO L226 Difference]: Without dead ends: 1064 [2022-11-20 20:33:06,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-11-20 20:33:06,914 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 177 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:33:06,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 22 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-20 20:33:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-11-20 20:33:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1009. [2022-11-20 20:33:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1000 states have (on average 1.871) internal successors, (1871), 1008 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1871 transitions. [2022-11-20 20:33:06,935 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1871 transitions. Word has length 36 [2022-11-20 20:33:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:33:06,935 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1871 transitions. [2022-11-20 20:33:06,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1871 transitions. [2022-11-20 20:33:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 20:33:06,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:33:06,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:33:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 20:33:06,937 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:33:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:33:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2108876762, now seen corresponding path program 1 times [2022-11-20 20:33:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:33:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696865162] [2022-11-20 20:33:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:33:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:33:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:33:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:33:08,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:33:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696865162] [2022-11-20 20:33:08,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696865162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:33:08,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:33:08,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 20:33:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839088125] [2022-11-20 20:33:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:33:08,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:33:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:33:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:33:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:33:08,195 INFO L87 Difference]: Start difference. First operand 1009 states and 1871 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:33:11,133 INFO L93 Difference]: Finished difference Result 1132 states and 2102 transitions. [2022-11-20 20:33:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:33:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-20 20:33:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:33:11,136 INFO L225 Difference]: With dead ends: 1132 [2022-11-20 20:33:11,136 INFO L226 Difference]: Without dead ends: 1132 [2022-11-20 20:33:11,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:33:11,137 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 108 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:33:11,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 63 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-20 20:33:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-11-20 20:33:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1047. [2022-11-20 20:33:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1038 states have (on average 1.8757225433526012) internal successors, (1947), 1046 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1947 transitions. [2022-11-20 20:33:11,159 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1947 transitions. Word has length 38 [2022-11-20 20:33:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:33:11,159 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1947 transitions. [2022-11-20 20:33:11,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1947 transitions. [2022-11-20 20:33:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 20:33:11,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:33:11,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:33:11,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 20:33:11,161 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:33:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:33:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1090761962, now seen corresponding path program 2 times [2022-11-20 20:33:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:33:11,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251015813] [2022-11-20 20:33:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:33:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:33:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:33:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:33:12,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:33:12,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251015813] [2022-11-20 20:33:12,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251015813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:33:12,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:33:12,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 20:33:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688635379] [2022-11-20 20:33:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:33:12,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:33:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:33:12,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:33:12,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:33:12,323 INFO L87 Difference]: Start difference. First operand 1047 states and 1947 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:33:15,420 INFO L93 Difference]: Finished difference Result 1142 states and 2122 transitions. [2022-11-20 20:33:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:33:15,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-20 20:33:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:33:15,422 INFO L225 Difference]: With dead ends: 1142 [2022-11-20 20:33:15,423 INFO L226 Difference]: Without dead ends: 1142 [2022-11-20 20:33:15,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:33:15,423 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:33:15,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 72 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-20 20:33:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-11-20 20:33:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1046. [2022-11-20 20:33:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1037 states have (on average 1.875602700096432) internal successors, (1945), 1045 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1945 transitions. [2022-11-20 20:33:15,443 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1945 transitions. Word has length 38 [2022-11-20 20:33:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:33:15,443 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1945 transitions. [2022-11-20 20:33:15,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1945 transitions. [2022-11-20 20:33:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 20:33:15,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:33:15,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:33:15,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 20:33:15,446 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:33:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:33:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash 831450838, now seen corresponding path program 3 times [2022-11-20 20:33:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:33:15,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826134162] [2022-11-20 20:33:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:33:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:33:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:33: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. [2022-11-20 20:33:16,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:33:16,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826134162] [2022-11-20 20:33:16,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826134162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:33:16,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:33:16,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 20:33:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270503635] [2022-11-20 20:33:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:33:16,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:33:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:33:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:33:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:33:16,577 INFO L87 Difference]: Start difference. First operand 1046 states and 1945 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:33:19,351 INFO L93 Difference]: Finished difference Result 1080 states and 2004 transitions. [2022-11-20 20:33:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 20:33:19,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-20 20:33:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:33:19,354 INFO L225 Difference]: With dead ends: 1080 [2022-11-20 20:33:19,354 INFO L226 Difference]: Without dead ends: 1080 [2022-11-20 20:33:19,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-11-20 20:33:19,355 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 184 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:33:19,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 90 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 20:33:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-11-20 20:33:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 976. [2022-11-20 20:33:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 967 states have (on average 1.8728024819027922) internal successors, (1811), 975 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1811 transitions. [2022-11-20 20:33:19,374 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1811 transitions. Word has length 38 [2022-11-20 20:33:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:33:19,375 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1811 transitions. [2022-11-20 20:33:19,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:33:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1811 transitions. [2022-11-20 20:33:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 20:33:19,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:33:19,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:33:19,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 20:33:19,377 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-20 20:33:19,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:33:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash 670038863, now seen corresponding path program 1 times [2022-11-20 20:33:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:33:19,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108593538] [2022-11-20 20:33:19,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:33:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:33:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:33:19,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:33:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:33:19,638 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 20:33:19,639 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:33:19,640 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2022-11-20 20:33:19,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2022-11-20 20:33:19,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2022-11-20 20:33:19,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2022-11-20 20:33:19,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2022-11-20 20:33:19,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2022-11-20 20:33:19,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2022-11-20 20:33:19,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2022-11-20 20:33:19,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2022-11-20 20:33:19,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2022-11-20 20:33:19,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2022-11-20 20:33:19,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2022-11-20 20:33:19,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2022-11-20 20:33:19,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2022-11-20 20:33:19,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2022-11-20 20:33:19,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2022-11-20 20:33:19,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2022-11-20 20:33:19,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2022-11-20 20:33:19,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2022-11-20 20:33:19,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2022-11-20 20:33:19,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 37 remaining) [2022-11-20 20:33:19,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2022-11-20 20:33:19,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2022-11-20 20:33:19,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2022-11-20 20:33:19,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2022-11-20 20:33:19,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2022-11-20 20:33:19,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2022-11-20 20:33:19,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2022-11-20 20:33:19,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2022-11-20 20:33:19,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2022-11-20 20:33:19,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2022-11-20 20:33:19,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2022-11-20 20:33:19,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2022-11-20 20:33:19,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2022-11-20 20:33:19,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2022-11-20 20:33:19,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2022-11-20 20:33:19,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2022-11-20 20:33:19,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 20:33:19,657 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:33:19,664 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 20:33:19,664 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:33:19,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:33:19 BasicIcfg [2022-11-20 20:33:19,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:33:19,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:33:19,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:33:19,754 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:33:19,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:20:32" (3/4) ... [2022-11-20 20:33:19,757 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 20:33:19,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:33:19,758 INFO L158 Benchmark]: Toolchain (without parser) took 769236.06ms. Allocated memory was 159.4MB in the beginning and 629.1MB in the end (delta: 469.8MB). Free memory was 113.9MB in the beginning and 537.1MB in the end (delta: -423.2MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2022-11-20 20:33:19,758 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 115.3MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:33:19,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1086.57ms. Allocated memory is still 159.4MB. Free memory was 113.9MB in the beginning and 114.3MB in the end (delta: -395.8kB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-11-20 20:33:19,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.52ms. Allocated memory is still 159.4MB. Free memory was 114.3MB in the beginning and 111.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 20:33:19,759 INFO L158 Benchmark]: Boogie Preprocessor took 43.67ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 107.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:33:19,762 INFO L158 Benchmark]: RCFGBuilder took 904.87ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 77.4MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 20:33:19,762 INFO L158 Benchmark]: TraceAbstraction took 767096.81ms. Allocated memory was 159.4MB in the beginning and 629.1MB in the end (delta: 469.8MB). Free memory was 76.6MB in the beginning and 537.1MB in the end (delta: -460.6MB). Peak memory consumption was 352.8MB. Max. memory is 16.1GB. [2022-11-20 20:33:19,763 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 629.1MB. Free memory is still 537.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:33:19,770 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 115.3MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1086.57ms. Allocated memory is still 159.4MB. Free memory was 113.9MB in the beginning and 114.3MB in the end (delta: -395.8kB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.52ms. Allocated memory is still 159.4MB. Free memory was 114.3MB in the beginning and 111.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.67ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 107.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 904.87ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 77.4MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 767096.81ms. Allocated memory was 159.4MB in the beginning and 629.1MB in the end (delta: 469.8MB). Free memory was 76.6MB in the beginning and 537.1MB in the end (delta: -460.6MB). Peak memory consumption was 352.8MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 629.1MB. Free memory is still 537.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 681.2s, 280 PlacesBefore, 95 PlacesAfterwards, 276 TransitionsBefore, 91 TransitionsAfterwards, 7728 CoEnabledTransitionPairs, 18 FixpointIterations, 195 TrivialSequentialCompositions, 93 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 288 TotalNumberOfCompositions, 102063 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18236, independent: 15700, independent conditional: 0, independent unconditional: 15700, dependent: 2536, dependent conditional: 0, dependent unconditional: 2536, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5493, independent: 5240, independent conditional: 0, independent unconditional: 5240, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5493, independent: 4068, independent conditional: 0, independent unconditional: 4068, dependent: 1425, dependent conditional: 0, dependent unconditional: 1425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1425, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2238, independent: 1539, independent conditional: 0, independent unconditional: 1539, dependent: 699, dependent conditional: 0, dependent unconditional: 699, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18236, independent: 10460, independent conditional: 0, independent unconditional: 10460, dependent: 2283, dependent conditional: 0, dependent unconditional: 2283, unknown: 5493, unknown conditional: 0, unknown unconditional: 5493] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 925, Positive conditional cache size: 0, Positive unconditional cache size: 925, Negative cache size: 123, Negative conditional cache size: 0, Negative unconditional cache size: 123, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1259]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] 0 init(A,3) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] 0 init(B,5) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next [L1251] 0 B->next = p [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={-2:0}, A->next={-3:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, t1={13:0}] [L1254] 0 p = A->next [L1255] EXPR 0 p->datum VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) [L1258] EXPR 0 B->next VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B->next={-3:0}, B_mutex={2:0}, p={-3:0}, t1={13:0}] [L1235] EXPR 1 A->next [L1235] EXPR 1 A->next->datum [L1235] 1 A->next->datum++ VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=9, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={2:0}] [L1258] 0 p = B->next [L1259] EXPR 0 p->datum VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=9, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, p->datum=10, t1={13:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=44, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, p->datum=10, t1={13:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: A->next = p [1248] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: A = malloc(sizeof(struct s)) [1246] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: B->next = p [1251] * C: A->next->datum++ [1235] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: B->next = p [1251] * C: B->next = p [1251] * C: B = malloc(sizeof(struct s)) [1249] * C: p -> next = ((void *)0) [1229] and C: printf("%d\n", p->datum) [1259] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 348 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 766.8s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 60.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 681.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2194 SdHoareTripleChecker+Valid, 57.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2194 mSDsluCounter, 1412 SdHoareTripleChecker+Invalid, 55.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 2032 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13233 IncrementalHoareTripleChecker+Invalid, 15265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2032 mSolverCounterUnsat, 667 mSDtfsCounter, 13233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1600occurred in iteration=6, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 4142 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 8801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 20:33:19,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9381a5b0-fc52-47f3-bd03-5b9b2acc2a55/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE