./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/condvar.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur --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 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:42:53,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:42:53,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:42:53,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:42:53,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:42:53,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:42:53,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:42:53,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:42:53,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:42:53,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:42:53,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:42:53,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:42:53,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:42:53,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:42:53,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:42:53,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:42:53,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:42:53,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:42:53,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:42:53,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:42:53,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:42:53,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:42:53,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:42:53,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:42:54,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:42:54,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:42:54,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:42:54,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:42:54,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:42:54,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:42:54,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:42:54,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:42:54,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:42:54,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:42:54,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:42:54,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:42:54,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:42:54,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:42:54,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:42:54,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:42:54,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:42:54,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-25 23:42:54,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:42:54,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:42:54,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:42:54,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:42:54,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:42:54,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:42:54,081 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:42:54,082 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:42:54,082 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:42:54,082 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:42:54,084 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:42:54,084 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:42:54,084 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:42:54,084 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:42:54,085 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:42:54,085 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:42:54,085 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:42:54,086 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:42:54,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:42:54,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:42:54,087 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:42:54,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:42:54,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:42:54,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:42:54,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:42:54,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:42:54,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:42:54,089 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-25 23:42:54,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:42:54,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:42:54,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:42:54,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:42:54,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:42:54,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:42:54,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:54,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:42:54,092 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:42:54,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:42:54,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:42:54,093 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:42:54,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:42:54,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:42:54,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:42:54,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/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_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2022-11-25 23:42:54,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:42:54,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:42:54,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:42:54,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:42:54,459 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:42:54,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-divine/condvar.i [2022-11-25 23:42:57,588 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:42:57,836 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:42:57,836 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/sv-benchmarks/c/pthread-divine/condvar.i [2022-11-25 23:42:57,856 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/data/581536a0d/773f3a8001874909b828765f28e4d253/FLAG2dedd5113 [2022-11-25 23:42:57,873 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/data/581536a0d/773f3a8001874909b828765f28e4d253 [2022-11-25 23:42:57,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:42:57,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:42:57,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:57,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:42:57,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:42:57,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:57" (1/1) ... [2022-11-25 23:42:57,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f5b3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:57, skipping insertion in model container [2022-11-25 23:42:57,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:57" (1/1) ... [2022-11-25 23:42:57,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:42:57,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:42:58,155 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:42:58,398 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/sv-benchmarks/c/pthread-divine/condvar.i[30458,30471] [2022-11-25 23:42:58,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:58,422 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:42:58,439 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:42:58,481 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/sv-benchmarks/c/pthread-divine/condvar.i[30458,30471] [2022-11-25 23:42:58,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:58,553 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:42:58,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58 WrapperNode [2022-11-25 23:42:58,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:58,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:58,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:42:58,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:42:58,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,622 INFO L138 Inliner]: procedures = 169, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2022-11-25 23:42:58,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:58,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:42:58,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:42:58,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:42:58,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,646 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:42:58,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:42:58,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:42:58,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:42:58,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (1/1) ... [2022-11-25 23:42:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:58,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:58,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:42:58,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:42:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:42:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:42:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 23:42:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:42:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:42:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:42:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:42:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-11-25 23:42:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-11-25 23:42:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:42:58,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:42:58,741 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:42:58,912 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:42:58,914 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:42:59,152 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:42:59,159 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:42:59,160 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:42:59,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:59 BoogieIcfgContainer [2022-11-25 23:42:59,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:42:59,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:42:59,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:42:59,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:42:59,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:42:57" (1/3) ... [2022-11-25 23:42:59,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fb7476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:59, skipping insertion in model container [2022-11-25 23:42:59,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:58" (2/3) ... [2022-11-25 23:42:59,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fb7476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:59, skipping insertion in model container [2022-11-25 23:42:59,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:59" (3/3) ... [2022-11-25 23:42:59,172 INFO L112 eAbstractionObserver]: Analyzing ICFG condvar.i [2022-11-25 23:42:59,181 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:42:59,192 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:42:59,193 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-11-25 23:42:59,193 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:42:59,268 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-25 23:42:59,317 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:42:59,339 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 99 transitions, 206 flow [2022-11-25 23:42:59,344 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 99 transitions, 206 flow [2022-11-25 23:42:59,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 99 transitions, 206 flow [2022-11-25 23:42:59,432 INFO L130 PetriNetUnfolder]: 5/98 cut-off events. [2022-11-25 23:42:59,432 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 23:42:59,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 98 events. 5/98 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2022-11-25 23:42:59,442 INFO L119 LiptonReduction]: Number of co-enabled transitions 1176 [2022-11-25 23:43:03,827 INFO L134 LiptonReduction]: Checked pairs total: 3090 [2022-11-25 23:43:03,828 INFO L136 LiptonReduction]: Total number of compositions: 84 [2022-11-25 23:43:03,841 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 26 transitions, 60 flow [2022-11-25 23:43:03,866 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 90 states, 79 states have (on average 2.4936708860759493) internal successors, (197), 89 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:03,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:43:03,897 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10c78eed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:43:03,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 23:43:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 79 states have (on average 2.4936708860759493) internal successors, (197), 89 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:43:03,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:03,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:43:03,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash 10907518, now seen corresponding path program 1 times [2022-11-25 23:43:03,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:03,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977768640] [2022-11-25 23:43:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:04,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:04,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977768640] [2022-11-25 23:43:04,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977768640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:04,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:43:04,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:43:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664339129] [2022-11-25 23:43:04,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:04,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:43:04,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:04,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:43:04,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:43:04,137 INFO L87 Difference]: Start difference. First operand has 90 states, 79 states have (on average 2.4936708860759493) internal successors, (197), 89 states have internal predecessors, (197), 0 states have call successors, (0), 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 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:04,179 INFO L93 Difference]: Finished difference Result 81 states and 160 transitions. [2022-11-25 23:43:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:43:04,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:43:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:04,195 INFO L225 Difference]: With dead ends: 81 [2022-11-25 23:43:04,195 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 23:43:04,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:43:04,200 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:04,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 23:43:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-25 23:43:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 2.191780821917808) internal successors, (160), 80 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 160 transitions. [2022-11-25 23:43:04,259 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 160 transitions. Word has length 4 [2022-11-25 23:43:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:04,260 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 160 transitions. [2022-11-25 23:43:04,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 160 transitions. [2022-11-25 23:43:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:43:04,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:04,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:43:04,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:43:04,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 338122527, now seen corresponding path program 1 times [2022-11-25 23:43:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:04,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741777683] [2022-11-25 23:43:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:04,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:04,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:04,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741777683] [2022-11-25 23:43:04,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741777683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:04,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:43:04,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:43:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137143744] [2022-11-25 23:43:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:43:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:43:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,423 INFO L87 Difference]: Start difference. First operand 81 states and 160 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:04,474 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2022-11-25 23:43:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:43:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:43:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:04,477 INFO L225 Difference]: With dead ends: 100 [2022-11-25 23:43:04,477 INFO L226 Difference]: Without dead ends: 100 [2022-11-25 23:43:04,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,479 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:04,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-25 23:43:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2022-11-25 23:43:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 2.183098591549296) internal successors, (155), 77 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 155 transitions. [2022-11-25 23:43:04,489 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 155 transitions. Word has length 5 [2022-11-25 23:43:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:04,489 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 155 transitions. [2022-11-25 23:43:04,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 155 transitions. [2022-11-25 23:43:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:43:04,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:04,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:43:04,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:43:04,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1892165035, now seen corresponding path program 1 times [2022-11-25 23:43:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890423985] [2022-11-25 23:43:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:04,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:04,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890423985] [2022-11-25 23:43:04,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890423985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:04,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:43:04,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:43:04,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792851847] [2022-11-25 23:43:04,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:04,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:43:04,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:04,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:43:04,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,538 INFO L87 Difference]: Start difference. First operand 78 states and 155 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:04,573 INFO L93 Difference]: Finished difference Result 78 states and 153 transitions. [2022-11-25 23:43:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:43:04,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:43:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:04,575 INFO L225 Difference]: With dead ends: 78 [2022-11-25 23:43:04,575 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 23:43:04,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,577 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:04,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 23:43:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-25 23:43:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 77 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 153 transitions. [2022-11-25 23:43:04,584 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 153 transitions. Word has length 6 [2022-11-25 23:43:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:04,585 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 153 transitions. [2022-11-25 23:43:04,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 153 transitions. [2022-11-25 23:43:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:43:04,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:04,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:43:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:43:04,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1892160698, now seen corresponding path program 1 times [2022-11-25 23:43:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:04,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277379054] [2022-11-25 23:43:04,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:04,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:04,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277379054] [2022-11-25 23:43:04,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277379054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:04,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:43:04,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:43:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363389989] [2022-11-25 23:43:04,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:04,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:43:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:04,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:43:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,655 INFO L87 Difference]: Start difference. First operand 78 states and 153 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:04,685 INFO L93 Difference]: Finished difference Result 110 states and 215 transitions. [2022-11-25 23:43:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:43:04,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:43:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:04,687 INFO L225 Difference]: With dead ends: 110 [2022-11-25 23:43:04,687 INFO L226 Difference]: Without dead ends: 110 [2022-11-25 23:43:04,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,688 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:04,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-25 23:43:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 86. [2022-11-25 23:43:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 2.1392405063291138) internal successors, (169), 85 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 169 transitions. [2022-11-25 23:43:04,697 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 169 transitions. Word has length 6 [2022-11-25 23:43:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:04,697 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 169 transitions. [2022-11-25 23:43:04,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 169 transitions. [2022-11-25 23:43:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:43:04,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:04,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:04,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:43:04,699 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1481757172, now seen corresponding path program 1 times [2022-11-25 23:43:04,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:04,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180976218] [2022-11-25 23:43:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:04,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:04,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180976218] [2022-11-25 23:43:04,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180976218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:04,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:43:04,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:43:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522872490] [2022-11-25 23:43:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:04,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:43:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:43:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,733 INFO L87 Difference]: Start difference. First operand 86 states and 169 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:04,768 INFO L93 Difference]: Finished difference Result 100 states and 190 transitions. [2022-11-25 23:43:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:43:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:43:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:04,770 INFO L225 Difference]: With dead ends: 100 [2022-11-25 23:43:04,770 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 23:43:04,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:04,771 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:04,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 23:43:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-11-25 23:43:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 2.0779220779220777) internal successors, (160), 82 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 160 transitions. [2022-11-25 23:43:04,779 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 160 transitions. Word has length 7 [2022-11-25 23:43:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:04,780 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 160 transitions. [2022-11-25 23:43:04,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 160 transitions. [2022-11-25 23:43:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:43:04,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:04,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:04,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:43:04,781 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1951469667, now seen corresponding path program 1 times [2022-11-25 23:43:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:04,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403899907] [2022-11-25 23:43:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:04,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403899907] [2022-11-25 23:43:04,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403899907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:04,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389487829] [2022-11-25 23:43:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:04,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:04,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:04,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:43:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:04,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:43:04,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:43:04,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:43:04,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389487829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:04,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:43:04,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-25 23:43:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601979262] [2022-11-25 23:43:04,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:43:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:43:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:43:04,969 INFO L87 Difference]: Start difference. First operand 83 states and 160 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:05,003 INFO L93 Difference]: Finished difference Result 83 states and 153 transitions. [2022-11-25 23:43:05,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:43:05,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:43:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:05,005 INFO L225 Difference]: With dead ends: 83 [2022-11-25 23:43:05,005 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:43:05,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:43:05,006 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:05,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:43:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-11-25 23:43:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 108 transitions. [2022-11-25 23:43:05,011 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 108 transitions. Word has length 9 [2022-11-25 23:43:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:05,012 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 108 transitions. [2022-11-25 23:43:05,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 108 transitions. [2022-11-25 23:43:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:43:05,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:05,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:05,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:05,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:05,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -377984865, now seen corresponding path program 1 times [2022-11-25 23:43:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417619505] [2022-11-25 23:43:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:05,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:05,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417619505] [2022-11-25 23:43:05,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417619505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:05,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:43:05,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:43:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115146266] [2022-11-25 23:43:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:05,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:43:05,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:43:05,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:05,284 INFO L87 Difference]: Start difference. First operand 63 states and 108 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:05,306 INFO L93 Difference]: Finished difference Result 42 states and 75 transitions. [2022-11-25 23:43:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:43:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 23:43:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:05,307 INFO L225 Difference]: With dead ends: 42 [2022-11-25 23:43:05,307 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 23:43:05,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:43:05,308 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:05,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 23:43:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 23:43:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 37 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 66 transitions. [2022-11-25 23:43:05,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 66 transitions. Word has length 10 [2022-11-25 23:43:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:05,312 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 66 transitions. [2022-11-25 23:43:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 66 transitions. [2022-11-25 23:43:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:43:05,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:05,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:05,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:43:05,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1549658184, now seen corresponding path program 1 times [2022-11-25 23:43:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:05,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650933206] [2022-11-25 23:43:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:05,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:05,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650933206] [2022-11-25 23:43:05,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650933206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:05,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910663400] [2022-11-25 23:43:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:05,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:05,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:05,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:43:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:05,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:43:05,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:05,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:05,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910663400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:05,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1925386379] [2022-11-25 23:43:05,512 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:43:05,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:05,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-25 23:43:05,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267301583] [2022-11-25 23:43:05,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:05,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:43:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:05,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:43:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:43:05,516 INFO L87 Difference]: Start difference. First operand 38 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:05,573 INFO L93 Difference]: Finished difference Result 65 states and 120 transitions. [2022-11-25 23:43:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:43:05,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 23:43:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:05,575 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:43:05,575 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:43:05,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:43:05,576 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:05,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 18 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:43:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 23:43:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.9047619047619047) internal successors, (120), 64 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 120 transitions. [2022-11-25 23:43:05,581 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 120 transitions. Word has length 11 [2022-11-25 23:43:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:05,581 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 120 transitions. [2022-11-25 23:43:05,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 120 transitions. [2022-11-25 23:43:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:43:05,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:05,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:05,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:05,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:05,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1948699547, now seen corresponding path program 2 times [2022-11-25 23:43:05,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:05,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315853539] [2022-11-25 23:43:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:05,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:05,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:05,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315853539] [2022-11-25 23:43:05,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315853539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:05,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916218579] [2022-11-25 23:43:05,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:43:05,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:05,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:05,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:05,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:43:06,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 23:43:06,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:06,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:06,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:06,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:06,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916218579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:06,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2146180011] [2022-11-25 23:43:06,167 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:43:06,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:06,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-25 23:43:06,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285289031] [2022-11-25 23:43:06,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:06,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:43:06,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:06,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:43:06,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:43:06,170 INFO L87 Difference]: Start difference. First operand 65 states and 120 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:06,272 INFO L93 Difference]: Finished difference Result 119 states and 228 transitions. [2022-11-25 23:43:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:43:06,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:43:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:06,275 INFO L225 Difference]: With dead ends: 119 [2022-11-25 23:43:06,275 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 23:43:06,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:43:06,278 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:06,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 47 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:43:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 23:43:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-25 23:43:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.9487179487179487) internal successors, (228), 118 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 228 transitions. [2022-11-25 23:43:06,305 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 228 transitions. Word has length 20 [2022-11-25 23:43:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:06,305 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 228 transitions. [2022-11-25 23:43:06,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 228 transitions. [2022-11-25 23:43:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:43:06,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:06,312 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:06,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:06,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:06,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1488099269, now seen corresponding path program 3 times [2022-11-25 23:43:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:06,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663306408] [2022-11-25 23:43:06,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:06,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:06,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663306408] [2022-11-25 23:43:06,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663306408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:06,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562186674] [2022-11-25 23:43:06,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:43:06,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:06,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:06,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:06,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:43:06,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:43:06,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:06,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:43:06,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:07,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:07,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562186674] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1417479284] [2022-11-25 23:43:07,277 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:43:07,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:07,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-25 23:43:07,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495195318] [2022-11-25 23:43:07,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:07,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 23:43:07,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 23:43:07,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:43:07,280 INFO L87 Difference]: Start difference. First operand 119 states and 228 transitions. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:07,479 INFO L93 Difference]: Finished difference Result 227 states and 444 transitions. [2022-11-25 23:43:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:43:07,479 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-25 23:43:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:07,481 INFO L225 Difference]: With dead ends: 227 [2022-11-25 23:43:07,481 INFO L226 Difference]: Without dead ends: 227 [2022-11-25 23:43:07,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:43:07,482 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 162 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:07,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 71 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:43:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-25 23:43:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-11-25 23:43:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 1.9733333333333334) internal successors, (444), 226 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 444 transitions. [2022-11-25 23:43:07,499 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 444 transitions. Word has length 38 [2022-11-25 23:43:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:07,500 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 444 transitions. [2022-11-25 23:43:07,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 444 transitions. [2022-11-25 23:43:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 23:43:07,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:07,510 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:07,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:07,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:43:07,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:07,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1594955397, now seen corresponding path program 4 times [2022-11-25 23:43:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:07,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717449751] [2022-11-25 23:43:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:08,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:08,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717449751] [2022-11-25 23:43:08,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717449751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:08,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538790867] [2022-11-25 23:43:08,366 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:43:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:08,370 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:08,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:43:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:08,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 23:43:08,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:08,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:09,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538790867] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:09,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1685196249] [2022-11-25 23:43:09,508 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:43:09,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:09,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 46 [2022-11-25 23:43:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257647670] [2022-11-25 23:43:09,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:09,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 23:43:09,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 23:43:09,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:43:09,512 INFO L87 Difference]: Start difference. First operand 227 states and 444 transitions. Second operand has 46 states, 46 states have (on average 3.0869565217391304) internal successors, (142), 46 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:09,963 INFO L93 Difference]: Finished difference Result 416 states and 822 transitions. [2022-11-25 23:43:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-25 23:43:09,963 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.0869565217391304) internal successors, (142), 46 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-25 23:43:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:09,966 INFO L225 Difference]: With dead ends: 416 [2022-11-25 23:43:09,966 INFO L226 Difference]: Without dead ends: 416 [2022-11-25 23:43:09,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:43:09,967 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 361 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:09,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 121 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:43:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-25 23:43:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-11-25 23:43:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 414 states have (on average 1.9855072463768115) internal successors, (822), 415 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 822 transitions. [2022-11-25 23:43:09,978 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 822 transitions. Word has length 74 [2022-11-25 23:43:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:09,979 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 822 transitions. [2022-11-25 23:43:09,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.0869565217391304) internal successors, (142), 46 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 822 transitions. [2022-11-25 23:43:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-25 23:43:09,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:09,981 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:09,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:10,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:10,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-25 23:43:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:10,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1573786792, now seen corresponding path program 5 times [2022-11-25 23:43:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:10,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138373025] [2022-11-25 23:43:10,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:43:10,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:43:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:43:10,321 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:43:10,321 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:43:10,327 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-11-25 23:43:10,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-11-25 23:43:10,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-11-25 23:43:10,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-11-25 23:43:10,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2022-11-25 23:43:10,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-11-25 23:43:10,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-11-25 23:43:10,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-11-25 23:43:10,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:43:10,332 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:10,339 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 23:43:10,339 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:43:10,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:43:10 BasicIcfg [2022-11-25 23:43:10,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:43:10,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:43:10,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:43:10,464 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:43:10,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:59" (3/4) ... [2022-11-25 23:43:10,467 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:43:10,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:43:10,468 INFO L158 Benchmark]: Toolchain (without parser) took 12590.08ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 96.7MB in the beginning and 105.4MB in the end (delta: -8.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2022-11-25 23:43:10,468 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:43:10,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.42ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 76.4MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 23:43:10,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.88ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:43:10,469 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:43:10,470 INFO L158 Benchmark]: RCFGBuilder took 511.36ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 58.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 23:43:10,470 INFO L158 Benchmark]: TraceAbstraction took 11298.89ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 57.5MB in the beginning and 105.4MB in the end (delta: -47.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-11-25 23:43:10,470 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 207.6MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:43:10,472 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.27ms. Allocated memory is still 142.6MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 674.42ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 76.4MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.88ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.36ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 58.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11298.89ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 57.5MB in the beginning and 105.4MB in the end (delta: -47.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 207.6MB. Free memory is still 105.4MB. 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: 4.5s, 98 PlacesBefore, 26 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 3090 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1792, independent: 1611, independent conditional: 0, independent unconditional: 1611, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 886, independent: 845, independent conditional: 0, independent unconditional: 845, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 886, independent: 834, independent conditional: 0, independent unconditional: 834, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1792, independent: 766, independent conditional: 0, independent unconditional: 766, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 886, unknown conditional: 0, unknown unconditional: 886] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 704]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; [L698] 0 pthread_cond_t cond; [L699] 0 int x; [L700] 0 _Bool x_set = 0; [L711] 0 pthread_t t; [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [arg={0:0}, cond={4:0}, lock={3:0}, pthread_create( &t, ((void *)0), thread, ((void *)0) )=-1, t={7:0}, x=0, x_set=0] [L713] 0 int i = 0; VAL [arg={0:0}, cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=1, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=2, lock={3:0}, t={7:0}, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=3, lock={3:0}, t={7:0}, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=4, lock={3:0}, t={7:0}, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=5, lock={3:0}, t={7:0}, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=6, lock={3:0}, t={7:0}, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=7, lock={3:0}, t={7:0}, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=8, lock={3:0}, t={7:0}, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=9, lock={3:0}, t={7:0}, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=10, lock={3:0}, t={7:0}, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=11, lock={3:0}, t={7:0}, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=12, lock={3:0}, t={7:0}, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=13, lock={3:0}, t={7:0}, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=14, lock={3:0}, t={7:0}, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=15, lock={3:0}, t={7:0}, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=16, lock={3:0}, t={7:0}, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=17, lock={3:0}, t={7:0}, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=18, lock={3:0}, t={7:0}, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=19, lock={3:0}, t={7:0}, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=20, lock={3:0}, t={7:0}, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=21, lock={3:0}, t={7:0}, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=22, lock={3:0}, t={7:0}, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=23, lock={3:0}, t={7:0}, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=24, lock={3:0}, t={7:0}, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=25, lock={3:0}, t={7:0}, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=26, lock={3:0}, t={7:0}, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=27, lock={3:0}, t={7:0}, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=28, lock={3:0}, t={7:0}, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=29, lock={3:0}, t={7:0}, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=30, lock={3:0}, t={7:0}, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=31, lock={3:0}, t={7:0}, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=32, lock={3:0}, t={7:0}, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=33, lock={3:0}, t={7:0}, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=34, lock={3:0}, t={7:0}, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=35, lock={3:0}, t={7:0}, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=36, lock={3:0}, t={7:0}, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=37, lock={3:0}, t={7:0}, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=38, lock={3:0}, t={7:0}, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=39, lock={3:0}, t={7:0}, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=40, lock={3:0}, t={7:0}, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=41, lock={3:0}, t={7:0}, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=42, lock={3:0}, t={7:0}, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=0] [L704] 1 !x_set VAL [arg={0:0}, arg={0:0}, cond={4:0}, lock={3:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) [L715] 0 x_set = 1 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=1, x_set = 1=153] [L704] 1 !x_set VAL [arg={0:0}, arg={0:0}, cond={4:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: 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: 706]: 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, 115 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 641 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 697 IncrementalHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 92 mSDtfsCounter, 697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416occurred in iteration=11, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 960 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 1/2651 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 23:43:10,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fecf04-8867-4ce0-be7a-0c2ac94aad15/bin/utaipan-ByfvJB40ur/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