./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/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_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7 --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 --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:54:47,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:54:47,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:54:47,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:54:47,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:54:47,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:54:47,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:54:47,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:54:47,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:54:47,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:54:47,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:54:47,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:54:47,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:54:47,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:54:47,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:54:47,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:54:47,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:54:47,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:54:47,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:54:47,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:54:47,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:54:47,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:54:47,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:54:47,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:54:47,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:54:47,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:54:47,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:54:47,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:54:47,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:54:47,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:54:47,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:54:47,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:54:47,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:54:47,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:54:47,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:54:47,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:54:47,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:54:47,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:54:47,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:54:47,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:54:47,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:54:47,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-25 19:54:47,687 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:54:47,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:54:47,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:54:47,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:54:47,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:54:47,695 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:54:47,695 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:54:47,696 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:54:47,696 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:54:47,696 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:54:47,697 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:54:47,697 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:54:47,697 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:54:47,698 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:54:47,698 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:54:47,698 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:54:47,698 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:54:47,698 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:54:47,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:54:47,699 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:54:47,699 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 19:54:47,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:54:47,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:54:47,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:54:47,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:54:47,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:54:47,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:54:47,701 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-25 19:54:47,701 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:54:47,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:54:47,701 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:54:47,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:54:47,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:54:47,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:54:47,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:54:47,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:54:47,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:54:47,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:54:47,703 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:54:47,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:54:47,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:54:47,704 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:54:47,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:54:47,705 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/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_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7 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 [2021-11-25 19:54:48,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:54:48,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:54:48,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:54:48,066 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:54:48,067 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:54:48,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2021-11-25 19:54:48,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/data/d15f2644f/35a1369853b043b1936561ae5ee22274/FLAGc3fdb4885 [2021-11-25 19:54:48,881 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:54:48,882 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2021-11-25 19:54:48,906 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/data/d15f2644f/35a1369853b043b1936561ae5ee22274/FLAGc3fdb4885 [2021-11-25 19:54:49,114 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/data/d15f2644f/35a1369853b043b1936561ae5ee22274 [2021-11-25 19:54:49,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:54:49,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:54:49,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:54:49,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:54:49,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:54:49,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:54:49" (1/1) ... [2021-11-25 19:54:49,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6e2959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:49, skipping insertion in model container [2021-11-25 19:54:49,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:54:49" (1/1) ... [2021-11-25 19:54:49,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:54:49,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:54:49,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:54:49,816 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:54:49,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:54:50,013 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:54:50,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50 WrapperNode [2021-11-25 19:54:50,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:54:50,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:54:50,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:54:50,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:54:50,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,110 INFO L137 Inliner]: procedures = 368, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2021-11-25 19:54:50,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:54:50,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:54:50,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:54:50,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:54:50,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:54:50,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:54:50,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:54:50,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:54:50,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (1/1) ... [2021-11-25 19:54:50,168 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:54:50,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:54:50,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:54:50,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:54:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:54:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 19:54:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:54:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 19:54:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:54:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 19:54:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 19:54:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:54:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 19:54:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-25 19:54:50,242 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-25 19:54:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:54:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:54:50,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:54:50,244 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:54:50,396 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:54:50,409 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:54:50,933 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:54:50,949 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:54:50,952 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-25 19:54:50,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:54:50 BoogieIcfgContainer [2021-11-25 19:54:50,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:54:50,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:54:50,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:54:50,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:54:50,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:54:49" (1/3) ... [2021-11-25 19:54:50,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709b2253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:54:50, skipping insertion in model container [2021-11-25 19:54:50,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:54:50" (2/3) ... [2021-11-25 19:54:50,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709b2253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:54:50, skipping insertion in model container [2021-11-25 19:54:50,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:54:50" (3/3) ... [2021-11-25 19:54:50,971 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2021-11-25 19:54:50,977 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:54:50,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:54:50,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-11-25 19:54:50,978 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:54:51,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,042 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,043 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,043 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,043 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,048 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,055 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,060 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,060 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,060 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,060 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,061 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,061 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,061 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,061 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,061 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,062 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,062 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,062 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,062 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,062 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,066 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,066 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,066 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,066 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,067 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,067 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,067 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,072 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,072 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,072 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,072 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,072 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,077 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,077 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,077 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,077 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,077 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,086 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,086 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,086 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,086 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,089 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,090 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,092 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,093 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:54:51,098 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-25 19:54:51,143 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:54:51,149 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 19:54:51,149 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-11-25 19:54:51,167 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:54:51,180 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 286 transitions, 577 flow [2021-11-25 19:54:51,183 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 286 transitions, 577 flow [2021-11-25 19:54:51,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 290 places, 286 transitions, 577 flow [2021-11-25 19:54:51,317 INFO L129 PetriNetUnfolder]: 0/285 cut-off events. [2021-11-25 19:54:51,320 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-25 19:54:51,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 285 events. 0/285 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/257 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-11-25 19:54:51,332 INFO L116 LiptonReduction]: Number of co-enabled transitions 7728 [2021-11-25 19:55:22,213 WARN L227 SmtUtils]: Spent 10.42s on a formula simplification. DAG size of input: 132 DAG size of output: 129 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:55:36,276 WARN L227 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 132 DAG size of output: 129 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:55:47,793 WARN L227 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 122 DAG size of output: 113 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:55:58,559 WARN L227 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 122 DAG size of output: 113 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:56:53,918 WARN L227 SmtUtils]: Spent 18.89s on a formula simplification. DAG size of input: 136 DAG size of output: 134 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:56:59,655 WARN L227 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:57:19,824 WARN L227 SmtUtils]: Spent 20.17s on a formula simplification. DAG size of input: 136 DAG size of output: 134 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:57:25,769 WARN L227 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:57:37,315 WARN L227 SmtUtils]: Spent 11.50s on a formula simplification that was a NOOP. DAG size: 251 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:57:42,421 WARN L227 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:57:50,939 WARN L227 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 251 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:58:02,935 WARN L227 SmtUtils]: Spent 11.99s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 19:59:23,482 WARN L227 SmtUtils]: Spent 1.34m on a formula simplification that was a NOOP. DAG size: 318 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:01:13,539 WARN L227 SmtUtils]: Spent 1.83m on a formula simplification that was a NOOP. DAG size: 310 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:02:15,206 WARN L227 SmtUtils]: Spent 1.03m on a formula simplification that was a NOOP. DAG size: 318 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:02:31,963 WARN L227 SmtUtils]: Spent 16.75s on a formula simplification that was a NOOP. DAG size: 310 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:04:08,422 WARN L227 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 368 DAG size of output: 366 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:04:53,841 WARN L227 SmtUtils]: Spent 45.41s on a formula simplification that was a NOOP. DAG size: 358 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:06:27,540 WARN L227 SmtUtils]: Spent 1.56m on a formula simplification. DAG size of input: 368 DAG size of output: 366 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:07:12,121 WARN L227 SmtUtils]: Spent 44.57s on a formula simplification that was a NOOP. DAG size: 358 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:07:12,308 INFO L131 LiptonReduction]: Checked pairs total: 101991 [2021-11-25 20:07:12,309 INFO L133 LiptonReduction]: Total number of compositions: 325 [2021-11-25 20:07:12,320 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 91 transitions, 187 flow [2021-11-25 20:07:12,418 INFO L133 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) [2021-11-25 20:07:12,424 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) [2021-11-25 20:07:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-25 20:07:12,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:12,429 INFO L514 BasicCegarLoop]: trace histogram [1] [2021-11-25 20:07:12,430 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash 959, now seen corresponding path program 1 times [2021-11-25 20:07:12,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:12,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485308074] [2021-11-25 20:07:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:12,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:12,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:12,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485308074] [2021-11-25 20:07:12,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485308074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:12,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:12,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-25 20:07:12,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345451094] [2021-11-25 20:07:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:12,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 20:07:12,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 20:07:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:07:12,639 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) [2021-11-25 20:07:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:13,060 INFO L93 Difference]: Finished difference Result 1285 states and 2496 transitions. [2021-11-25 20:07:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 20:07:13,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2021-11-25 20:07:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:13,102 INFO L225 Difference]: With dead ends: 1285 [2021-11-25 20:07:13,102 INFO L226 Difference]: Without dead ends: 1285 [2021-11-25 20:07:13,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:07:13,106 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:13,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:07:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2021-11-25 20:07:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2021-11-25 20:07:13,218 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) [2021-11-25 20:07:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2496 transitions. [2021-11-25 20:07:13,225 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2496 transitions. Word has length 1 [2021-11-25 20:07:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:13,226 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 2496 transitions. [2021-11-25 20:07:13,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:07:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2496 transitions. [2021-11-25 20:07:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 20:07:13,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:13,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:13,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:07:13,228 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash 120106461, now seen corresponding path program 1 times [2021-11-25 20:07:13,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:13,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072510615] [2021-11-25 20:07:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:13,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:13,692 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:13,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072510615] [2021-11-25 20:07:13,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072510615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:13,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:13,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:07:13,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485367104] [2021-11-25 20:07:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:13,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:07:13,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:07:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:07:13,695 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) [2021-11-25 20:07:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:14,574 INFO L93 Difference]: Finished difference Result 2028 states and 3927 transitions. [2021-11-25 20:07:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:07:14,575 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 [2021-11-25 20:07:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:14,589 INFO L225 Difference]: With dead ends: 2028 [2021-11-25 20:07:14,589 INFO L226 Difference]: Without dead ends: 2028 [2021-11-25 20:07:14,589 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:07:14,591 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 78 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:14,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 15 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:07:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2021-11-25 20:07:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1252. [2021-11-25 20:07:14,665 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) [2021-11-25 20:07:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2431 transitions. [2021-11-25 20:07:14,671 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2431 transitions. Word has length 7 [2021-11-25 20:07:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:14,671 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 2431 transitions. [2021-11-25 20:07:14,671 INFO L471 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) [2021-11-25 20:07:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2431 transitions. [2021-11-25 20:07:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-25 20:07:14,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:14,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:14,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:07:14,673 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:14,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash -991968710, now seen corresponding path program 1 times [2021-11-25 20:07:14,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:14,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100670287] [2021-11-25 20:07:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:14,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:14,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100670287] [2021-11-25 20:07:14,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100670287] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:14,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:14,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:07:14,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165026950] [2021-11-25 20:07:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:14,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:07:14,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:14,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:07:14,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:14,841 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) [2021-11-25 20:07:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:15,904 INFO L93 Difference]: Finished difference Result 1990 states and 3852 transitions. [2021-11-25 20:07:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:07:15,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-25 20:07:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:15,919 INFO L225 Difference]: With dead ends: 1990 [2021-11-25 20:07:15,919 INFO L226 Difference]: Without dead ends: 1990 [2021-11-25 20:07:15,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:15,932 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 72 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:15,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 16 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 20:07:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-11-25 20:07:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1344. [2021-11-25 20:07:15,982 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) [2021-11-25 20:07:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2611 transitions. [2021-11-25 20:07:15,988 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2611 transitions. Word has length 9 [2021-11-25 20:07:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:15,989 INFO L470 AbstractCegarLoop]: Abstraction has 1344 states and 2611 transitions. [2021-11-25 20:07:15,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:07:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2611 transitions. [2021-11-25 20:07:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 20:07:15,990 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:15,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:16,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:07:16,009 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:16,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1102939702, now seen corresponding path program 1 times [2021-11-25 20:07:16,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:16,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705587529] [2021-11-25 20:07:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:16,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:16,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:16,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705587529] [2021-11-25 20:07:16,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705587529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:16,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:16,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:07:16,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795697686] [2021-11-25 20:07:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:16,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:07:16,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:16,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:07:16,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:07:16,200 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) [2021-11-25 20:07:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:17,380 INFO L93 Difference]: Finished difference Result 1312 states and 2548 transitions. [2021-11-25 20:07:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:07:17,381 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 [2021-11-25 20:07:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:17,390 INFO L225 Difference]: With dead ends: 1312 [2021-11-25 20:07:17,390 INFO L226 Difference]: Without dead ends: 1312 [2021-11-25 20:07:17,390 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:07:17,391 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:17,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 38 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:07:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-11-25 20:07:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2021-11-25 20:07:17,425 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) [2021-11-25 20:07:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2548 transitions. [2021-11-25 20:07:17,431 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2548 transitions. Word has length 11 [2021-11-25 20:07:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:17,431 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 2548 transitions. [2021-11-25 20:07:17,431 INFO L471 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) [2021-11-25 20:07:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2548 transitions. [2021-11-25 20:07:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:07:17,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:17,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:17,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:07:17,434 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -992767573, now seen corresponding path program 1 times [2021-11-25 20:07:17,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:17,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130744155] [2021-11-25 20:07:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:17,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:17,619 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:17,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130744155] [2021-11-25 20:07:17,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130744155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:17,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:17,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:07:17,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987766777] [2021-11-25 20:07:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:17,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:07:17,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:07:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:17,622 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) [2021-11-25 20:07:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:18,919 INFO L93 Difference]: Finished difference Result 1780 states and 3439 transitions. [2021-11-25 20:07:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:07:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:07:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:18,933 INFO L225 Difference]: With dead ends: 1780 [2021-11-25 20:07:18,933 INFO L226 Difference]: Without dead ends: 1768 [2021-11-25 20:07:18,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:18,934 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 54 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:18,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 29 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 20:07:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2021-11-25 20:07:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1486. [2021-11-25 20:07:18,981 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) [2021-11-25 20:07:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2886 transitions. [2021-11-25 20:07:18,987 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2886 transitions. Word has length 15 [2021-11-25 20:07:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:18,987 INFO L470 AbstractCegarLoop]: Abstraction has 1486 states and 2886 transitions. [2021-11-25 20:07:18,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:07:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2886 transitions. [2021-11-25 20:07:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:07:18,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:18,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:18,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:07:18,994 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1393874624, now seen corresponding path program 1 times [2021-11-25 20:07:18,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:18,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118059433] [2021-11-25 20:07:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:18,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:19,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:19,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118059433] [2021-11-25 20:07:19,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118059433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:19,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:19,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:07:19,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773853519] [2021-11-25 20:07:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:19,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:07:19,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:07:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:19,206 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) [2021-11-25 20:07:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:20,046 INFO L93 Difference]: Finished difference Result 1600 states and 3110 transitions. [2021-11-25 20:07:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:07:20,047 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 [2021-11-25 20:07:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:20,057 INFO L225 Difference]: With dead ends: 1600 [2021-11-25 20:07:20,057 INFO L226 Difference]: Without dead ends: 1600 [2021-11-25 20:07:20,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:20,058 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:20,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:07:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-11-25 20:07:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2021-11-25 20:07:20,099 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) [2021-11-25 20:07:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3110 transitions. [2021-11-25 20:07:20,106 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3110 transitions. Word has length 17 [2021-11-25 20:07:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:20,107 INFO L470 AbstractCegarLoop]: Abstraction has 1600 states and 3110 transitions. [2021-11-25 20:07:20,107 INFO L471 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) [2021-11-25 20:07:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3110 transitions. [2021-11-25 20:07:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:07:20,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:20,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:20,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:07:20,110 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -549974456, now seen corresponding path program 1 times [2021-11-25 20:07:20,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:20,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417215406] [2021-11-25 20:07:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:20,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:20,214 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417215406] [2021-11-25 20:07:20,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417215406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:20,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:20,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:07:20,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575235717] [2021-11-25 20:07:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:20,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:07:20,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:07:20,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:07:20,216 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) [2021-11-25 20:07:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:20,985 INFO L93 Difference]: Finished difference Result 1167 states and 2188 transitions. [2021-11-25 20:07:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:07:20,985 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 [2021-11-25 20:07:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:20,992 INFO L225 Difference]: With dead ends: 1167 [2021-11-25 20:07:20,992 INFO L226 Difference]: Without dead ends: 1167 [2021-11-25 20:07:20,992 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:07:20,993 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 54 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:20,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:07:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2021-11-25 20:07:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1139. [2021-11-25 20:07:21,041 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) [2021-11-25 20:07:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2160 transitions. [2021-11-25 20:07:21,045 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2160 transitions. Word has length 20 [2021-11-25 20:07:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:21,046 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 2160 transitions. [2021-11-25 20:07:21,046 INFO L471 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) [2021-11-25 20:07:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2160 transitions. [2021-11-25 20:07:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:07:21,047 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:21,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:21,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 20:07:21,047 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash -558489142, now seen corresponding path program 1 times [2021-11-25 20:07:21,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:21,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382628972] [2021-11-25 20:07:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:21,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:21,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:21,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382628972] [2021-11-25 20:07:21,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382628972] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:21,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:21,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:07:21,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038595540] [2021-11-25 20:07:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:21,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:07:21,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:07:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:07:21,177 INFO L87 Difference]: Start difference. First operand 1139 states and 2160 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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) [2021-11-25 20:07:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:22,446 INFO L93 Difference]: Finished difference Result 1311 states and 2475 transitions. [2021-11-25 20:07:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:07:22,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 [2021-11-25 20:07:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:22,455 INFO L225 Difference]: With dead ends: 1311 [2021-11-25 20:07:22,455 INFO L226 Difference]: Without dead ends: 1311 [2021-11-25 20:07:22,455 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:07:22,457 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:22,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 26 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:07:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2021-11-25 20:07:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1104. [2021-11-25 20:07:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1089 states have (on average 1.9201101928374655) internal successors, (2091), 1103 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:07:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2091 transitions. [2021-11-25 20:07:22,496 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2091 transitions. Word has length 23 [2021-11-25 20:07:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:22,497 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2091 transitions. [2021-11-25 20:07:22,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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) [2021-11-25 20:07:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2091 transitions. [2021-11-25 20:07:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:07:22,497 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:22,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:22,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 20:07:22,498 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1603748911, now seen corresponding path program 1 times [2021-11-25 20:07:22,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:22,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515221982] [2021-11-25 20:07:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:22,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:22,711 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:22,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515221982] [2021-11-25 20:07:22,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515221982] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:22,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:22,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:07:22,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899072868] [2021-11-25 20:07:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:22,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:07:22,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:07:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:22,713 INFO L87 Difference]: Start difference. First operand 1104 states and 2091 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) [2021-11-25 20:07:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:23,861 INFO L93 Difference]: Finished difference Result 1292 states and 2430 transitions. [2021-11-25 20:07:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:07:23,861 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 [2021-11-25 20:07:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:23,869 INFO L225 Difference]: With dead ends: 1292 [2021-11-25 20:07:23,869 INFO L226 Difference]: Without dead ends: 1250 [2021-11-25 20:07:23,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:23,870 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 99 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:23,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 27 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 20:07:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-11-25 20:07:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1116. [2021-11-25 20:07:23,901 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) [2021-11-25 20:07:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2100 transitions. [2021-11-25 20:07:23,905 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 2100 transitions. Word has length 23 [2021-11-25 20:07:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:23,905 INFO L470 AbstractCegarLoop]: Abstraction has 1116 states and 2100 transitions. [2021-11-25 20:07:23,905 INFO L471 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) [2021-11-25 20:07:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 2100 transitions. [2021-11-25 20:07:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 20:07:23,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:23,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:23,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 20:07:23,907 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1775076439, now seen corresponding path program 1 times [2021-11-25 20:07:23,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:23,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76708093] [2021-11-25 20:07:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:23,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:24,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:24,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76708093] [2021-11-25 20:07:24,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76708093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:24,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:24,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:07:24,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633960010] [2021-11-25 20:07:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:24,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:07:24,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:24,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:07:24,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:07:24,058 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) [2021-11-25 20:07:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:24,905 INFO L93 Difference]: Finished difference Result 1081 states and 2032 transitions. [2021-11-25 20:07:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:07:24,905 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 [2021-11-25 20:07:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:24,911 INFO L225 Difference]: With dead ends: 1081 [2021-11-25 20:07:24,911 INFO L226 Difference]: Without dead ends: 1081 [2021-11-25 20:07:24,911 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:07:24,912 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:24,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 38 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:07:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-11-25 20:07:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2021-11-25 20:07:24,939 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) [2021-11-25 20:07:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 2032 transitions. [2021-11-25 20:07:24,943 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 2032 transitions. Word has length 27 [2021-11-25 20:07:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:24,943 INFO L470 AbstractCegarLoop]: Abstraction has 1081 states and 2032 transitions. [2021-11-25 20:07:24,943 INFO L471 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) [2021-11-25 20:07:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 2032 transitions. [2021-11-25 20:07:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 20:07:24,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:24,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:24,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 20:07:24,945 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 63735872, now seen corresponding path program 1 times [2021-11-25 20:07:24,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:24,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2950124] [2021-11-25 20:07:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:24,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:25,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:25,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2950124] [2021-11-25 20:07:25,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2950124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:25,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:25,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:07:25,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052326758] [2021-11-25 20:07:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:25,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:07:25,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:07:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:25,131 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) [2021-11-25 20:07:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:26,522 INFO L93 Difference]: Finished difference Result 1194 states and 2244 transitions. [2021-11-25 20:07:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:07:26,523 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 [2021-11-25 20:07:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:26,530 INFO L225 Difference]: With dead ends: 1194 [2021-11-25 20:07:26,530 INFO L226 Difference]: Without dead ends: 1132 [2021-11-25 20:07:26,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:07:26,531 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:26,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 36 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 20:07:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-11-25 20:07:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2021-11-25 20:07:26,559 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) [2021-11-25 20:07:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2108 transitions. [2021-11-25 20:07:26,562 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2108 transitions. Word has length 33 [2021-11-25 20:07:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:26,562 INFO L470 AbstractCegarLoop]: Abstraction has 1132 states and 2108 transitions. [2021-11-25 20:07:26,563 INFO L471 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) [2021-11-25 20:07:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2108 transitions. [2021-11-25 20:07:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:07:26,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:26,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:26,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 20:07:26,566 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1383955797, now seen corresponding path program 1 times [2021-11-25 20:07:26,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:26,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463494813] [2021-11-25 20:07:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:26,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:26,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:26,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463494813] [2021-11-25 20:07:26,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463494813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:26,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:26,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:07:26,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286409052] [2021-11-25 20:07:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:26,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:07:26,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:07:26,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:07:26,919 INFO L87 Difference]: Start difference. First operand 1132 states and 2108 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 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) [2021-11-25 20:07:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:28,164 INFO L93 Difference]: Finished difference Result 1258 states and 2345 transitions. [2021-11-25 20:07:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:07:28,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 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 [2021-11-25 20:07:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:28,170 INFO L225 Difference]: With dead ends: 1258 [2021-11-25 20:07:28,170 INFO L226 Difference]: Without dead ends: 1258 [2021-11-25 20:07:28,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:07:28,171 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:28,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 35 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:07:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2021-11-25 20:07:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1183. [2021-11-25 20:07:28,228 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) [2021-11-25 20:07:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2213 transitions. [2021-11-25 20:07:28,233 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 2213 transitions. Word has length 34 [2021-11-25 20:07:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:28,233 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 2213 transitions. [2021-11-25 20:07:28,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 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) [2021-11-25 20:07:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 2213 transitions. [2021-11-25 20:07:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:07:28,235 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:28,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:28,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 20:07:28,236 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash -982248188, now seen corresponding path program 1 times [2021-11-25 20:07:28,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:28,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963296683] [2021-11-25 20:07:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:28,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:28,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:28,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963296683] [2021-11-25 20:07:28,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963296683] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:28,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:28,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:07:28,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400120526] [2021-11-25 20:07:28,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:28,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:07:28,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:07:28,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:07:28,543 INFO L87 Difference]: Start difference. First operand 1183 states and 2213 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) [2021-11-25 20:07:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:29,961 INFO L93 Difference]: Finished difference Result 1173 states and 2190 transitions. [2021-11-25 20:07:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:07:29,962 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 [2021-11-25 20:07:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:29,967 INFO L225 Difference]: With dead ends: 1173 [2021-11-25 20:07:29,967 INFO L226 Difference]: Without dead ends: 1173 [2021-11-25 20:07:29,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:07:29,968 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 113 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:29,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 61 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 20:07:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-11-25 20:07:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1133. [2021-11-25 20:07:29,995 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) [2021-11-25 20:07:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2021-11-25 20:07:29,998 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2021-11-25 20:07:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:29,999 INFO L470 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2021-11-25 20:07:29,999 INFO L471 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) [2021-11-25 20:07:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2021-11-25 20:07:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:07:30,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:30,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:30,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 20:07:30,001 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1050070829, now seen corresponding path program 2 times [2021-11-25 20:07:30,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:30,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193011684] [2021-11-25 20:07:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:30,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:30,433 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193011684] [2021-11-25 20:07:30,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193011684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:30,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:30,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:07:30,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121885179] [2021-11-25 20:07:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:30,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:07:30,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:07:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:07:30,436 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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) [2021-11-25 20:07:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:32,515 INFO L93 Difference]: Finished difference Result 1476 states and 2740 transitions. [2021-11-25 20:07:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 20:07:32,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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 [2021-11-25 20:07:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:32,524 INFO L225 Difference]: With dead ends: 1476 [2021-11-25 20:07:32,525 INFO L226 Difference]: Without dead ends: 1476 [2021-11-25 20:07:32,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2021-11-25 20:07:32,526 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 97 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:32,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 53 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:07:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-11-25 20:07:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1120. [2021-11-25 20:07:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1109 states have (on average 1.87917042380523) internal successors, (2084), 1119 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:07:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2084 transitions. [2021-11-25 20:07:32,575 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2084 transitions. Word has length 34 [2021-11-25 20:07:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:32,577 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 2084 transitions. [2021-11-25 20:07:32,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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) [2021-11-25 20:07:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2084 transitions. [2021-11-25 20:07:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:07:32,579 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:32,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:32,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 20:07:32,579 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1649433055, now seen corresponding path program 3 times [2021-11-25 20:07:32,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:32,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127405936] [2021-11-25 20:07:32,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:32,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:32,994 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:32,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127405936] [2021-11-25 20:07:32,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127405936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:32,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:32,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:07:32,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840692261] [2021-11-25 20:07:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:32,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:07:32,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:32,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:07:32,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:07:32,995 INFO L87 Difference]: Start difference. First operand 1120 states and 2084 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) [2021-11-25 20:07:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:34,750 INFO L93 Difference]: Finished difference Result 1450 states and 2688 transitions. [2021-11-25 20:07:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:07:34,751 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 [2021-11-25 20:07:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:34,757 INFO L225 Difference]: With dead ends: 1450 [2021-11-25 20:07:34,758 INFO L226 Difference]: Without dead ends: 1450 [2021-11-25 20:07:34,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:07:34,759 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:34,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 37 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 20:07:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2021-11-25 20:07:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1107. [2021-11-25 20:07:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1096 states have (on average 1.8777372262773722) internal successors, (2058), 1106 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:07:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 2058 transitions. [2021-11-25 20:07:34,789 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 2058 transitions. Word has length 34 [2021-11-25 20:07:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:34,789 INFO L470 AbstractCegarLoop]: Abstraction has 1107 states and 2058 transitions. [2021-11-25 20:07:34,790 INFO L471 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) [2021-11-25 20:07:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 2058 transitions. [2021-11-25 20:07:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 20:07:34,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:34,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:34,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 20:07:34,791 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1027058373, now seen corresponding path program 4 times [2021-11-25 20:07:34,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:34,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704904565] [2021-11-25 20:07:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:34,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:35,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:35,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704904565] [2021-11-25 20:07:35,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704904565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:35,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:35,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:07:35,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518847289] [2021-11-25 20:07:35,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:35,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:07:35,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:07:35,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:07:35,244 INFO L87 Difference]: Start difference. First operand 1107 states and 2058 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) [2021-11-25 20:07:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:37,845 INFO L93 Difference]: Finished difference Result 1408 states and 2604 transitions. [2021-11-25 20:07:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:07:37,845 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 [2021-11-25 20:07:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:37,851 INFO L225 Difference]: With dead ends: 1408 [2021-11-25 20:07:37,851 INFO L226 Difference]: Without dead ends: 1408 [2021-11-25 20:07:37,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2021-11-25 20:07:37,852 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 85 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:37,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 36 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:07:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2021-11-25 20:07:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1077. [2021-11-25 20:07:37,878 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) [2021-11-25 20:07:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1998 transitions. [2021-11-25 20:07:37,882 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1998 transitions. Word has length 34 [2021-11-25 20:07:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:37,882 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1998 transitions. [2021-11-25 20:07:37,883 INFO L471 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) [2021-11-25 20:07:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1998 transitions. [2021-11-25 20:07:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:07:37,884 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:37,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:37,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 20:07:37,885 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:37,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1105266808, now seen corresponding path program 1 times [2021-11-25 20:07:37,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:37,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554825269] [2021-11-25 20:07:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:37,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:38,372 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:38,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554825269] [2021-11-25 20:07:38,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554825269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:38,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:38,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:07:38,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850377933] [2021-11-25 20:07:38,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:38,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:07:38,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:07:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:07:38,374 INFO L87 Difference]: Start difference. First operand 1077 states and 1998 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) [2021-11-25 20:07:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:40,356 INFO L93 Difference]: Finished difference Result 1066 states and 1977 transitions. [2021-11-25 20:07:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:07:40,361 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 [2021-11-25 20:07:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:40,363 INFO L225 Difference]: With dead ends: 1066 [2021-11-25 20:07:40,364 INFO L226 Difference]: Without dead ends: 1058 [2021-11-25 20:07:40,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:07:40,365 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:40,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:07:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2021-11-25 20:07:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1039. [2021-11-25 20:07:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1030 states have (on average 1.8689320388349515) internal successors, (1925), 1038 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:07:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1925 transitions. [2021-11-25 20:07:40,389 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1925 transitions. Word has length 36 [2021-11-25 20:07:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:40,390 INFO L470 AbstractCegarLoop]: Abstraction has 1039 states and 1925 transitions. [2021-11-25 20:07:40,390 INFO L471 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) [2021-11-25 20:07:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1925 transitions. [2021-11-25 20:07:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:07:40,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:40,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:40,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 20:07:40,392 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1885077686, now seen corresponding path program 1 times [2021-11-25 20:07:40,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:40,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691335097] [2021-11-25 20:07:40,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:40,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:40,806 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:40,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691335097] [2021-11-25 20:07:40,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691335097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:40,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:40,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:07:40,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655818703] [2021-11-25 20:07:40,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:40,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:07:40,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:40,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:07:40,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:07:40,808 INFO L87 Difference]: Start difference. First operand 1039 states and 1925 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) [2021-11-25 20:07:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:42,785 INFO L93 Difference]: Finished difference Result 1033 states and 1913 transitions. [2021-11-25 20:07:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:07:42,786 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 [2021-11-25 20:07:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:42,788 INFO L225 Difference]: With dead ends: 1033 [2021-11-25 20:07:42,788 INFO L226 Difference]: Without dead ends: 1033 [2021-11-25 20:07:42,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:07:42,789 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 270 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:42,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 89 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:07:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2021-11-25 20:07:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1009. [2021-11-25 20:07:42,824 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) [2021-11-25 20:07:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1871 transitions. [2021-11-25 20:07:42,827 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1871 transitions. Word has length 36 [2021-11-25 20:07:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:42,828 INFO L470 AbstractCegarLoop]: Abstraction has 1009 states and 1871 transitions. [2021-11-25 20:07:42,828 INFO L471 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) [2021-11-25 20:07:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1871 transitions. [2021-11-25 20:07:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 20:07:42,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:42,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:42,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 20:07:42,830 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2048240548, now seen corresponding path program 1 times [2021-11-25 20:07:42,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:42,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266080067] [2021-11-25 20:07:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:42,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:43,257 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:43,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266080067] [2021-11-25 20:07:43,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266080067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:43,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:43,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:07:43,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585246576] [2021-11-25 20:07:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:43,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:07:43,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:43,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:07:43,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:07:43,259 INFO L87 Difference]: Start difference. First operand 1009 states and 1871 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2021-11-25 20:07:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:45,081 INFO L93 Difference]: Finished difference Result 1132 states and 2102 transitions. [2021-11-25 20:07:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 20:07:45,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 [2021-11-25 20:07:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:45,083 INFO L225 Difference]: With dead ends: 1132 [2021-11-25 20:07:45,083 INFO L226 Difference]: Without dead ends: 1132 [2021-11-25 20:07:45,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-11-25 20:07:45,084 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 131 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:45,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 43 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 20:07:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-11-25 20:07:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1047. [2021-11-25 20:07:45,107 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) [2021-11-25 20:07:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1947 transitions. [2021-11-25 20:07:45,110 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1947 transitions. Word has length 38 [2021-11-25 20:07:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:45,110 INFO L470 AbstractCegarLoop]: Abstraction has 1047 states and 1947 transitions. [2021-11-25 20:07:45,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2021-11-25 20:07:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1947 transitions. [2021-11-25 20:07:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 20:07:45,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:45,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:45,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 20:07:45,113 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1586810472, now seen corresponding path program 2 times [2021-11-25 20:07:45,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:45,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418846473] [2021-11-25 20:07:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:45,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:45,423 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:45,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418846473] [2021-11-25 20:07:45,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418846473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:45,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:45,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:07:45,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634800693] [2021-11-25 20:07:45,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:45,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:07:45,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:45,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:07:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:07:45,425 INFO L87 Difference]: Start difference. First operand 1047 states and 1947 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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) [2021-11-25 20:07:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:47,845 INFO L93 Difference]: Finished difference Result 1142 states and 2122 transitions. [2021-11-25 20:07:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 20:07:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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 [2021-11-25 20:07:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:47,847 INFO L225 Difference]: With dead ends: 1142 [2021-11-25 20:07:47,847 INFO L226 Difference]: Without dead ends: 1142 [2021-11-25 20:07:47,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-11-25 20:07:47,848 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 117 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:47,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 44 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 20:07:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2021-11-25 20:07:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1046. [2021-11-25 20:07:47,871 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) [2021-11-25 20:07:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1945 transitions. [2021-11-25 20:07:47,874 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1945 transitions. Word has length 38 [2021-11-25 20:07:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:47,874 INFO L470 AbstractCegarLoop]: Abstraction has 1046 states and 1945 transitions. [2021-11-25 20:07:47,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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) [2021-11-25 20:07:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1945 transitions. [2021-11-25 20:07:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 20:07:47,876 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:47,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:47,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-25 20:07:47,877 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1886670680, now seen corresponding path program 3 times [2021-11-25 20:07:47,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:47,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721029640] [2021-11-25 20:07:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:47,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:07:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:07:48,102 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:07:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721029640] [2021-11-25 20:07:48,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721029640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:07:48,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:07:48,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:07:48,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089204714] [2021-11-25 20:07:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:07:48,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:07:48,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:07:48,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:07:48,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:07:48,107 INFO L87 Difference]: Start difference. First operand 1046 states and 1945 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) [2021-11-25 20:07:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:07:50,224 INFO L93 Difference]: Finished difference Result 1080 states and 2004 transitions. [2021-11-25 20:07:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 20:07:50,224 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 [2021-11-25 20:07:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:07:50,227 INFO L225 Difference]: With dead ends: 1080 [2021-11-25 20:07:50,227 INFO L226 Difference]: Without dead ends: 1080 [2021-11-25 20:07:50,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-11-25 20:07:50,228 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 100 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:07:50,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 31 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 20:07:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2021-11-25 20:07:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 976. [2021-11-25 20:07:50,249 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) [2021-11-25 20:07:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1811 transitions. [2021-11-25 20:07:50,252 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1811 transitions. Word has length 38 [2021-11-25 20:07:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:07:50,253 INFO L470 AbstractCegarLoop]: Abstraction has 976 states and 1811 transitions. [2021-11-25 20:07:50,253 INFO L471 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) [2021-11-25 20:07:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1811 transitions. [2021-11-25 20:07:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-25 20:07:50,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:07:50,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:50,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 20:07:50,255 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-25 20:07:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:07:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1990753276, now seen corresponding path program 1 times [2021-11-25 20:07:50,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:07:50,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255134961] [2021-11-25 20:07:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:07:50,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:07:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 20:07:50,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 20:07:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 20:07:50,534 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 20:07:50,535 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 20:07:50,536 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2021-11-25 20:07:50,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2021-11-25 20:07:50,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2021-11-25 20:07:50,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2021-11-25 20:07:50,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2021-11-25 20:07:50,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2021-11-25 20:07:50,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2021-11-25 20:07:50,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2021-11-25 20:07:50,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2021-11-25 20:07:50,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2021-11-25 20:07:50,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2021-11-25 20:07:50,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2021-11-25 20:07:50,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2021-11-25 20:07:50,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2021-11-25 20:07:50,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2021-11-25 20:07:50,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2021-11-25 20:07:50,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2021-11-25 20:07:50,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2021-11-25 20:07:50,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2021-11-25 20:07:50,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2021-11-25 20:07:50,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (16 of 37 remaining) [2021-11-25 20:07:50,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2021-11-25 20:07:50,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2021-11-25 20:07:50,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2021-11-25 20:07:50,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2021-11-25 20:07:50,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2021-11-25 20:07:50,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2021-11-25 20:07:50,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2021-11-25 20:07:50,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2021-11-25 20:07:50,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2021-11-25 20:07:50,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2021-11-25 20:07:50,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2021-11-25 20:07:50,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2021-11-25 20:07:50,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2021-11-25 20:07:50,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2021-11-25 20:07:50,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2021-11-25 20:07:50,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2021-11-25 20:07:50,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-25 20:07:50,549 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:07:50,556 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-25 20:07:50,556 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 20:07:50,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:07:50 BasicIcfg [2021-11-25 20:07:50,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 20:07:50,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 20:07:50,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 20:07:50,660 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 20:07:50,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:54:50" (3/4) ... [2021-11-25 20:07:50,663 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-25 20:07:50,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 20:07:50,664 INFO L158 Benchmark]: Toolchain (without parser) took 781545.25ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 63.7MB in the beginning and 92.5MB in the end (delta: -28.8MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. [2021-11-25 20:07:50,664 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 20:07:50,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 892.67ms. Allocated memory is still 100.7MB. Free memory was 63.5MB in the beginning and 49.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-25 20:07:50,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.08ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 45.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 20:07:50,666 INFO L158 Benchmark]: Boogie Preprocessor took 47.29ms. Allocated memory is still 100.7MB. Free memory was 45.3MB in the beginning and 42.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 20:07:50,666 INFO L158 Benchmark]: RCFGBuilder took 798.65ms. Allocated memory is still 100.7MB. Free memory was 42.3MB in the beginning and 59.6MB in the end (delta: -17.2MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2021-11-25 20:07:50,666 INFO L158 Benchmark]: TraceAbstraction took 779699.17ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 59.0MB in the beginning and 93.5MB in the end (delta: -34.5MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2021-11-25 20:07:50,666 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 232.8MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 20:07:50,668 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.31ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 892.67ms. Allocated memory is still 100.7MB. Free memory was 63.5MB in the beginning and 49.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.08ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 45.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.29ms. Allocated memory is still 100.7MB. Free memory was 45.3MB in the beginning and 42.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 798.65ms. Allocated memory is still 100.7MB. Free memory was 42.3MB in the beginning and 59.6MB in the end (delta: -17.2MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 779699.17ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 59.0MB in the beginning and 93.5MB in the end (delta: -34.5MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 232.8MB. Free memory is still 92.5MB. 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: 741.1s, 290 PlacesBefore, 95 PlacesAfterwards, 286 TransitionsBefore, 91 TransitionsAfterwards, 7728 CoEnabledTransitionPairs, 18 FixpointIterations, 231 TrivialSequentialCompositions, 94 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 325 TotalNumberOfCompositions, 101991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24451, positive: 21918, positive conditional: 0, positive unconditional: 21918, negative: 2533, negative conditional: 0, negative unconditional: 2533, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5871, positive: 5627, positive conditional: 0, positive unconditional: 5627, negative: 244, negative conditional: 0, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5871, positive: 4346, positive conditional: 0, positive unconditional: 4346, negative: 1525, negative conditional: 0, negative unconditional: 1525, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1525, positive: 1281, positive conditional: 0, positive unconditional: 1281, negative: 244, negative conditional: 0, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1933, positive: 1360, positive conditional: 0, positive unconditional: 1360, negative: 573, negative conditional: 0, negative unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24451, positive: 16291, positive conditional: 0, positive unconditional: 16291, negative: 2289, negative conditional: 0, negative unconditional: 2289, unknown: 5871, unknown conditional: 0, unknown unconditional: 5871] , Statistics on independence cache: Total cache size (in pairs): 1144, Positive cache size: 1010, Positive conditional cache size: 0, Positive unconditional cache size: 1010, Negative cache size: 134, Negative conditional cache size: 0, Negative unconditional cache size: 134 - 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={11:0}, A_mutex={3:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1254] 0 p = A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1255] EXPR 0 p->datum VAL [A={11:0}, A_mutex={3:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) VAL [A={11:0}, A_mutex={3:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1235] EXPR 1 A->next [L1235] EXPR 1 A->next->datum [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}] [L1258] EXPR 0 B->next VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={-3:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1258] 0 p = B->next VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={-3:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1259] EXPR 0 p->datum VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=120, A->next->datum++=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=120, A->next->datum++=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, 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: p -> datum = x [1228] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: A->next = p [1248] * C: A->next = p [1248] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: B = malloc(sizeof(struct s)) [1249] * C: A->next = p [1248] * C: A->next->datum++ [1235] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: A = malloc(sizeof(struct s)) [1246] * C: A->next = p [1248] * C: B->next = p [1251] 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, 358 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 779.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 741.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1919 SdHoareTripleChecker+Valid, 29.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1919 mSDsluCounter, 831 SdHoareTripleChecker+Invalid, 27.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1844 mSDsCounter, 2291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12148 IncrementalHoareTripleChecker+Invalid, 14439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2291 mSolverCounterUnsat, 515 mSDtfsCounter, 12148 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1600occurred in iteration=6, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 3546 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 521 ConstructedInterpolants, 0 QuantifiedInterpolants, 7553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-25 20:07:50,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_259ae982-7b3b-499b-8bb5-56f8dd57246b/bin/utaipan-eEHZpOm5b7/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