./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh --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 dd8583a115904a75c64c276a67bc1fecbbb0d70873f2ea75f8f51b865297f64f --- 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-2329fc7 [2022-12-14 11:55:58,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:55:58,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:55:58,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:55:58,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:55:58,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:55:58,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:55:58,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:55:58,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:55:58,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:55:58,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:55:58,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:55:58,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:55:58,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:55:58,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:55:58,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:55:58,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:55:58,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:55:58,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:55:58,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:55:58,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:55:58,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:55:58,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:55:58,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:55:58,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:55:58,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:55:58,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:55:58,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:55:58,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:55:58,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:55:58,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:55:58,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:55:58,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:55:58,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:55:58,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:55:58,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:55:58,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:55:58,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:55:58,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:55:58,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:55:58,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:55:58,313 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 11:55:58,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:55:58,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:55:58,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:55:58,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:55:58,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:55:58,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:55:58,335 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:55:58,336 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:55:58,336 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:55:58,336 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:55:58,336 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:55:58,336 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:55:58,337 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:55:58,337 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:55:58,337 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:55:58,337 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:55:58,337 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:55:58,337 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:55:58,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:55:58,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:55:58,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:55:58,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:55:58,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:55:58,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:55:58,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:55:58,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:55:58,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:55:58,340 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 11:55:58,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:55:58,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:55:58,340 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:55:58,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:55:58,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:55:58,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:55:58,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:55:58,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:55:58,342 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:55:58,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:55:58,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:55:58,342 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:55:58,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:55:58,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:55:58,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:55:58,343 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_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/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_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh 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 -> dd8583a115904a75c64c276a67bc1fecbbb0d70873f2ea75f8f51b865297f64f [2022-12-14 11:55:58,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:55:58,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:55:58,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:55:58,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:55:58,561 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:55:58,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i [2022-12-14 11:56:01,047 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:56:01,234 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:56:01,234 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/sv-benchmarks/c/pthread/fib_unsafe-11-racy.i [2022-12-14 11:56:01,242 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/data/ab6451824/f3e6e28a91994086821067f4e33061ad/FLAG82e3d7f63 [2022-12-14 11:56:01,597 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/data/ab6451824/f3e6e28a91994086821067f4e33061ad [2022-12-14 11:56:01,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:56:01,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:56:01,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:56:01,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:56:01,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:56:01,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45563349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01, skipping insertion in model container [2022-12-14 11:56:01,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:56:01,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:56:01,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,845 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_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/sv-benchmarks/c/pthread/fib_unsafe-11-racy.i[30813,30826] [2022-12-14 11:56:01,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:56:01,853 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:56:01,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:56:01,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:56:01,884 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_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/sv-benchmarks/c/pthread/fib_unsafe-11-racy.i[30813,30826] [2022-12-14 11:56:01,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:56:01,902 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:56:01,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01 WrapperNode [2022-12-14 11:56:01,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:56:01,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:56:01,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:56:01,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:56:01,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,932 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-12-14 11:56:01,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:56:01,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:56:01,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:56:01,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:56:01,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,949 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:56:01,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:56:01,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:56:01,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:56:01,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (1/1) ... [2022-12-14 11:56:01,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:56:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:56:01,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:56:01,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:56:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 11:56:02,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 11:56:02,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:56:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 11:56:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:56:02,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:56:02,010 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:56:02,113 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:56:02,115 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:56:02,336 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:56:02,381 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:56:02,381 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 11:56:02,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:56:02 BoogieIcfgContainer [2022-12-14 11:56:02,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:56:02,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:56:02,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:56:02,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:56:02,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:56:01" (1/3) ... [2022-12-14 11:56:02,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c281be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:56:02, skipping insertion in model container [2022-12-14 11:56:02,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:01" (2/3) ... [2022-12-14 11:56:02,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c281be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:56:02, skipping insertion in model container [2022-12-14 11:56:02,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:56:02" (3/3) ... [2022-12-14 11:56:02,392 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11-racy.i [2022-12-14 11:56:02,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 11:56:02,412 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:56:02,412 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-12-14 11:56:02,412 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:56:02,477 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 11:56:02,511 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:56:02,525 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 193 transitions, 396 flow [2022-12-14 11:56:02,528 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 193 transitions, 396 flow [2022-12-14 11:56:02,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-12-14 11:56:02,592 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-12-14 11:56:02,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 11:56:02,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 8/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 367 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2022-12-14 11:56:02,607 INFO L119 LiptonReduction]: Number of co-enabled transitions 13080 [2022-12-14 11:56:05,801 INFO L134 LiptonReduction]: Checked pairs total: 14294 [2022-12-14 11:56:05,801 INFO L136 LiptonReduction]: Total number of compositions: 215 [2022-12-14 11:56:05,806 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 50 transitions, 110 flow [2022-12-14 11:56:05,864 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 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-12-14 11:56:05,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:56:05,882 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;@f74a7d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:56:05,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-12-14 11:56:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 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-12-14 11:56:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 11:56:05,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:05,891 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 11:56:05,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash 784, now seen corresponding path program 1 times [2022-12-14 11:56:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:05,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749973833] [2022-12-14 11:56:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:05,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:56:05,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749973833] [2022-12-14 11:56:05,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749973833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:56:05,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:56:05,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 11:56:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788162246] [2022-12-14 11:56:05,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:56:05,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 11:56:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:06,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 11:56:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:56:06,009 INFO L87 Difference]: Start difference. First operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:06,044 INFO L93 Difference]: Finished difference Result 87 states and 251 transitions. [2022-12-14 11:56:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 11:56:06,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-12-14 11:56:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:06,052 INFO L225 Difference]: With dead ends: 87 [2022-12-14 11:56:06,052 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 11:56:06,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:56:06,055 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:06,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:56:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 11:56:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 11:56:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 2.9420289855072466) internal successors, (203), 70 states have internal predecessors, (203), 0 states have call successors, (0), 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-12-14 11:56:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 203 transitions. [2022-12-14 11:56:06,083 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 203 transitions. Word has length 1 [2022-12-14 11:56:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:06,083 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 203 transitions. [2022-12-14 11:56:06,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 203 transitions. [2022-12-14 11:56:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 11:56:06,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:06,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:06,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:56:06,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1879081945, now seen corresponding path program 1 times [2022-12-14 11:56:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:06,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421853352] [2022-12-14 11:56:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:06,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:56:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421853352] [2022-12-14 11:56:06,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421853352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:56:06,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:56:06,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:56:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639328149] [2022-12-14 11:56:06,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:56:06,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:56:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:56:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:56:06,183 INFO L87 Difference]: Start difference. First operand 71 states and 203 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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-12-14 11:56:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:06,211 INFO L93 Difference]: Finished difference Result 80 states and 230 transitions. [2022-12-14 11:56:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:56:06,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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-12-14 11:56:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:06,214 INFO L225 Difference]: With dead ends: 80 [2022-12-14 11:56:06,214 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 11:56:06,214 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-12-14 11:56:06,215 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:06,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:56:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 11:56:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 11:56:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 2.948717948717949) internal successors, (230), 79 states have internal predecessors, (230), 0 states have call successors, (0), 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-12-14 11:56:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 230 transitions. [2022-12-14 11:56:06,224 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 230 transitions. Word has length 7 [2022-12-14 11:56:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:06,224 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 230 transitions. [2022-12-14 11:56:06,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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-12-14 11:56:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 230 transitions. [2022-12-14 11:56:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 11:56:06,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:06,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:06,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:56:06,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1878037586, now seen corresponding path program 1 times [2022-12-14 11:56:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:06,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154109245] [2022-12-14 11:56:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:06,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:56:06,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154109245] [2022-12-14 11:56:06,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154109245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:56:06,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658469859] [2022-12-14 11:56:06,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:06,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:56:06,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:56:06,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:56:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:06,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:56:06,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:56:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:56:06,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:56:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658469859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:56:06,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:56:06,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 11:56:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256665265] [2022-12-14 11:56:06,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:56:06,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:56:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:56:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:56:06,373 INFO L87 Difference]: Start difference. First operand 80 states and 230 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:06,409 INFO L93 Difference]: Finished difference Result 123 states and 355 transitions. [2022-12-14 11:56:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:56:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 11:56:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:06,411 INFO L225 Difference]: With dead ends: 123 [2022-12-14 11:56:06,412 INFO L226 Difference]: Without dead ends: 123 [2022-12-14 11:56:06,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-12-14 11:56:06,413 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:06,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:56:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-14 11:56:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2022-12-14 11:56:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 2.950617283950617) internal successors, (239), 82 states have internal predecessors, (239), 0 states have call successors, (0), 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-12-14 11:56:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 239 transitions. [2022-12-14 11:56:06,422 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 239 transitions. Word has length 8 [2022-12-14 11:56:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:06,423 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 239 transitions. [2022-12-14 11:56:06,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 239 transitions. [2022-12-14 11:56:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 11:56:06,423 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:06,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:06,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:56:06,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:06,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1690449209, now seen corresponding path program 1 times [2022-12-14 11:56:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:06,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586665135] [2022-12-14 11:56:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:06,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:56:06,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586665135] [2022-12-14 11:56:06,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586665135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:56:06,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452253524] [2022-12-14 11:56:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:06,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:06,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:56:06,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:56:06,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:56:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:06,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:56:06,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:56:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:06,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:56:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:06,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452253524] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:56:06,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1592130898] [2022-12-14 11:56:06,788 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-12-14 11:56:06,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:56:06,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 11:56:06,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517135376] [2022-12-14 11:56:06,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:56:06,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:56:06,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:06,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:56:06,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:56:06,792 INFO L87 Difference]: Start difference. First operand 83 states and 239 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:06,845 INFO L93 Difference]: Finished difference Result 110 states and 320 transitions. [2022-12-14 11:56:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:56:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 11:56:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:06,846 INFO L225 Difference]: With dead ends: 110 [2022-12-14 11:56:06,847 INFO L226 Difference]: Without dead ends: 110 [2022-12-14 11:56:06,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-12-14 11:56:06,847 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:06,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:56:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-14 11:56:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-12-14 11:56:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 2.962962962962963) internal successors, (320), 109 states have internal predecessors, (320), 0 states have call successors, (0), 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-12-14 11:56:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 320 transitions. [2022-12-14 11:56:06,855 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 320 transitions. Word has length 10 [2022-12-14 11:56:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:06,855 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 320 transitions. [2022-12-14 11:56:06,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 320 transitions. [2022-12-14 11:56:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:56:06,856 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:06,856 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:06,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 11:56:07,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:07,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1836154776, now seen corresponding path program 2 times [2022-12-14 11:56:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:07,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953687483] [2022-12-14 11:56:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:07,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:56:07,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953687483] [2022-12-14 11:56:07,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953687483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:56:07,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659974029] [2022-12-14 11:56:07,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:56:07,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:07,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:56:07,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:56:07,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:56:07,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:56:07,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:56:07,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:56:07,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:56:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:07,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:56:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:07,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659974029] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:56:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [85532828] [2022-12-14 11:56:07,375 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-12-14 11:56:07,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:56:07,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-14 11:56:07,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176072913] [2022-12-14 11:56:07,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:56:07,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 11:56:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:07,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 11:56:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:56:07,376 INFO L87 Difference]: Start difference. First operand 110 states and 320 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:07,470 INFO L93 Difference]: Finished difference Result 164 states and 482 transitions. [2022-12-14 11:56:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 11:56:07,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 11:56:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:07,472 INFO L225 Difference]: With dead ends: 164 [2022-12-14 11:56:07,473 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 11:56:07,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:56:07,474 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:07,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 21 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:56:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 11:56:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-12-14 11:56:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.9753086419753085) internal successors, (482), 163 states have internal predecessors, (482), 0 states have call successors, (0), 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-12-14 11:56:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 482 transitions. [2022-12-14 11:56:07,486 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 482 transitions. Word has length 13 [2022-12-14 11:56:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:07,486 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 482 transitions. [2022-12-14 11:56:07,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 482 transitions. [2022-12-14 11:56:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:56:07,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:07,488 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:07,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:56:07,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:07,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash -237199672, now seen corresponding path program 3 times [2022-12-14 11:56:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:07,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346401943] [2022-12-14 11:56:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:07,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:56:07,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346401943] [2022-12-14 11:56:07,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346401943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:56:07,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84226676] [2022-12-14 11:56:07,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:56:07,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:07,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:56:07,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:56:07,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:56:07,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:56:07,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:56:07,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 11:56:07,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:56:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:07,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:56:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:08,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84226676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:56:08,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [422811742] [2022-12-14 11:56:08,114 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-12-14 11:56:08,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:56:08,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-12-14 11:56:08,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30952830] [2022-12-14 11:56:08,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:56:08,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 11:56:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:08,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 11:56:08,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-14 11:56:08,116 INFO L87 Difference]: Start difference. First operand 164 states and 482 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:08,313 INFO L93 Difference]: Finished difference Result 272 states and 806 transitions. [2022-12-14 11:56:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 11:56:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 11:56:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:08,316 INFO L225 Difference]: With dead ends: 272 [2022-12-14 11:56:08,316 INFO L226 Difference]: Without dead ends: 272 [2022-12-14 11:56:08,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-14 11:56:08,317 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 351 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:08,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 15 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:56:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-12-14 11:56:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-12-14 11:56:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 2.9851851851851854) internal successors, (806), 271 states have internal predecessors, (806), 0 states have call successors, (0), 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-12-14 11:56:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 806 transitions. [2022-12-14 11:56:08,328 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 806 transitions. Word has length 19 [2022-12-14 11:56:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:08,328 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 806 transitions. [2022-12-14 11:56:08,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 806 transitions. [2022-12-14 11:56:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 11:56:08,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:08,332 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:08,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:56:08,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:08,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1775893624, now seen corresponding path program 4 times [2022-12-14 11:56:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:08,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059546015] [2022-12-14 11:56:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:08,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:56:08,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059546015] [2022-12-14 11:56:08,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059546015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:56:08,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752162523] [2022-12-14 11:56:08,997 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:56:08,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:56:08,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:56:08,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:56:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:56:09,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 11:56:09,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:56:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:09,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:56:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:09,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752162523] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:56:09,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1258501979] [2022-12-14 11:56:09,296 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-12-14 11:56:09,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:56:09,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 27 [2022-12-14 11:56:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733129920] [2022-12-14 11:56:09,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:56:09,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 11:56:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 11:56:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-12-14 11:56:09,298 INFO L87 Difference]: Start difference. First operand 272 states and 806 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:09,528 INFO L93 Difference]: Finished difference Result 290 states and 860 transitions. [2022-12-14 11:56:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 11:56:09,528 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 11:56:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:09,531 INFO L225 Difference]: With dead ends: 290 [2022-12-14 11:56:09,531 INFO L226 Difference]: Without dead ends: 290 [2022-12-14 11:56:09,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 22 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-12-14 11:56:09,532 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 324 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:09,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 21 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:56:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-12-14 11:56:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-12-14 11:56:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 288 states have (on average 2.986111111111111) internal successors, (860), 289 states have internal predecessors, (860), 0 states have call successors, (0), 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-12-14 11:56:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 860 transitions. [2022-12-14 11:56:09,547 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 860 transitions. Word has length 31 [2022-12-14 11:56:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:09,548 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 860 transitions. [2022-12-14 11:56:09,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 860 transitions. [2022-12-14 11:56:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 11:56:09,549 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:09,549 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:09,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:56:09,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:56:09,750 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-12-14 11:56:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1506685528, now seen corresponding path program 5 times [2022-12-14 11:56:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:56:09,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929023095] [2022-12-14 11:56:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:56:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:56:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:56:09,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 11:56:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:56:09,921 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 11:56:09,921 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 11:56:09,922 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-12-14 11:56:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-12-14 11:56:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-12-14 11:56:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-12-14 11:56:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-12-14 11:56:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-12-14 11:56:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-12-14 11:56:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-12-14 11:56:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-12-14 11:56:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-12-14 11:56:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-12-14 11:56:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-12-14 11:56:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-12-14 11:56:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-12-14 11:56:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-12-14 11:56:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-12-14 11:56:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-12-14 11:56:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-12-14 11:56:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-12-14 11:56:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-12-14 11:56:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-12-14 11:56:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-12-14 11:56:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-12-14 11:56:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-12-14 11:56:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-12-14 11:56:09,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:56:09,932 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-12-14 11:56:09,938 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 11:56:09,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:56:10,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:56:10 BasicIcfg [2022-12-14 11:56:10,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:56:10,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:56:10,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:56:10,004 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:56:10,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:56:02" (3/4) ... [2022-12-14 11:56:10,006 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 11:56:10,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:56:10,007 INFO L158 Benchmark]: Toolchain (without parser) took 8406.07ms. Allocated memory was 132.1MB in the beginning and 190.8MB in the end (delta: 58.7MB). Free memory was 98.7MB in the beginning and 52.1MB in the end (delta: 46.6MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2022-12-14 11:56:10,007 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:56:10,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.07ms. Allocated memory is still 132.1MB. Free memory was 98.7MB in the beginning and 78.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 11:56:10,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.52ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 76.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:56:10,007 INFO L158 Benchmark]: Boogie Preprocessor took 19.67ms. Allocated memory is still 132.1MB. Free memory was 76.1MB in the beginning and 74.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:56:10,008 INFO L158 Benchmark]: RCFGBuilder took 431.06ms. Allocated memory is still 132.1MB. Free memory was 74.5MB in the beginning and 53.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 11:56:10,008 INFO L158 Benchmark]: TraceAbstraction took 7617.13ms. Allocated memory was 132.1MB in the beginning and 190.8MB in the end (delta: 58.7MB). Free memory was 52.5MB in the beginning and 52.1MB in the end (delta: 425.6kB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2022-12-14 11:56:10,008 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 190.8MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:56:10,010 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.16ms. Allocated memory is still 132.1MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.07ms. Allocated memory is still 132.1MB. Free memory was 98.7MB in the beginning and 78.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.52ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 76.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.67ms. Allocated memory is still 132.1MB. Free memory was 76.1MB in the beginning and 74.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.06ms. Allocated memory is still 132.1MB. Free memory was 74.5MB in the beginning and 53.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7617.13ms. Allocated memory was 132.1MB in the beginning and 190.8MB in the end (delta: 58.7MB). Free memory was 52.5MB in the beginning and 52.1MB in the end (delta: 425.6kB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 190.8MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 192 PlacesBefore, 53 PlacesAfterwards, 193 TransitionsBefore, 50 TransitionsAfterwards, 13080 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 165 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 215 TotalNumberOfCompositions, 14294 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12590, independent: 12477, independent conditional: 0, independent unconditional: 12477, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8104, independent: 8047, independent conditional: 0, independent unconditional: 8047, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8104, independent: 7934, independent conditional: 0, independent unconditional: 7934, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 170, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12590, independent: 4430, independent conditional: 0, independent unconditional: 4430, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 8104, unknown conditional: 0, unknown unconditional: 8104] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; [L686] 0 int p, q; [L703] 0 int cur = 1, prev = 0, next = 0; [L704] 0 int x; [L714] 0 pthread_t id1, id2; [L716] 0 i = 1 [L719] 0 j = 1 [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=75026, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, cur=1, i=1, id1={6:0}, id2={7:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, q=0, x=0] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=75026, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, cur=1, i=1, id1={6:0}, id2={7:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 24 [L706] COND FALSE 0 !(x < 24) [L711] 0 return prev; [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); [L725] 0 i < correct VAL [\old(argc)=75026, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, correct=46368, cur=75025, i=1, id1={6:0}, id2={7:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] 1 p < 11 [L688] COND TRUE 1 p < 11 [L690] EXPR 1 i + j [L690] 1 i = i + j [L688] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=2, j=1, next=75025, p=1, prev=46368, q=0, x=24] [L725] 0 i < correct VAL [\old(argc)=75026, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, correct=46368, cur=75025, i=2, id1={6:0}, id2={7:0}, j=1, next=75025, p=1, prev=46368, q=0, x=24] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i < correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races 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. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races 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. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: 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: 722]: 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: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: 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 5 procedures, 246 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 21 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 111 SyntacticMatches, 22 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2122occurred in iteration=0, InterpolantAutomatonStates: 76, 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, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1085 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 1/959 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-12-14 11:56:10,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d9b103-b8bf-4b3b-a960-2a4a696b6dba/bin/utaipan-gh47qXpMRh/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