./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-12-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-12-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS --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 c4525591fa85ffc9750f318a48c09fdd29dc0d26cd65c6303a681f57303fc1a4 --- 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-8393723 [2022-11-19 07:49:25,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:49:25,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:49:25,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:49:25,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:49:25,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:49:25,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:49:25,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:49:25,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:49:25,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:49:25,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:49:25,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:49:25,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:49:25,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:49:25,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:49:25,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:49:25,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:49:25,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:49:25,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:49:25,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:49:25,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:49:25,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:49:25,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:49:25,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:49:25,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:49:25,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:49:25,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:49:25,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:49:25,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:49:25,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:49:25,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:49:25,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:49:25,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:49:25,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:49:25,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:49:25,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:49:25,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:49:25,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:49:25,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:49:25,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:49:25,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:49:25,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-19 07:49:25,546 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:49:25,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:49:25,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:49:25,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:49:25,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:49:25,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:49:25,553 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:49:25,553 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:49:25,553 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:49:25,553 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:49:25,554 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:49:25,554 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:49:25,554 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:49:25,554 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:49:25,554 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:49:25,555 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:49:25,555 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:49:25,555 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:49:25,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:49:25,556 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:49:25,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:49:25,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:49:25,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:49:25,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:49:25,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:49:25,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:49:25,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:49:25,557 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-19 07:49:25,558 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:49:25,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:49:25,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:49:25,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:49:25,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:49:25,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:49:25,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:49:25,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:49:25,559 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:49:25,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:49:25,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:49:25,560 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:49:25,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:49:25,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:49:25,561 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:49:25,561 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_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/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_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS 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 -> c4525591fa85ffc9750f318a48c09fdd29dc0d26cd65c6303a681f57303fc1a4 [2022-11-19 07:49:25,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:49:25,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:49:25,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:49:25,941 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:49:25,942 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:49:25,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread/fib_unsafe-12-racy.i [2022-11-19 07:49:26,019 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/data/e76fc7b51/4ef17df853b9470585ff264067451eff/FLAG519fc5cf4 [2022-11-19 07:49:26,544 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:49:26,544 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/sv-benchmarks/c/pthread/fib_unsafe-12-racy.i [2022-11-19 07:49:26,557 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/data/e76fc7b51/4ef17df853b9470585ff264067451eff/FLAG519fc5cf4 [2022-11-19 07:49:26,869 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/data/e76fc7b51/4ef17df853b9470585ff264067451eff [2022-11-19 07:49:26,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:49:26,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:49:26,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:49:26,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:49:26,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:49:26,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:26" (1/1) ... [2022-11-19 07:49:26,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5e1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:26, skipping insertion in model container [2022-11-19 07:49:26,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:26" (1/1) ... [2022-11-19 07:49:26,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:49:26,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:49:27,344 WARN L234 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_d6ab41cc-3018-4a44-8962-4b163405bba8/sv-benchmarks/c/pthread/fib_unsafe-12-racy.i[30813,30826] [2022-11-19 07:49:27,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:49:27,361 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:49:27,437 WARN L234 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_d6ab41cc-3018-4a44-8962-4b163405bba8/sv-benchmarks/c/pthread/fib_unsafe-12-racy.i[30813,30826] [2022-11-19 07:49:27,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:49:27,478 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:49:27,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27 WrapperNode [2022-11-19 07:49:27,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:49:27,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:49:27,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:49:27,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:49:27,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,557 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-11-19 07:49:27,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:49:27,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:49:27,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:49:27,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:49:27,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:49:27,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:49:27,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:49:27,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:49:27,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (1/1) ... [2022-11-19 07:49:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:49:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:49:27,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:49:27,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:49:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-19 07:49:27,717 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-19 07:49:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-19 07:49:27,717 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-19 07:49:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:49:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:49:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:49:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:49:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:49:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:49:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:49:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:49:27,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:49:27,720 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:49:27,893 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:49:27,896 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:49:28,273 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:49:28,367 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:49:28,378 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-19 07:49:28,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:28 BoogieIcfgContainer [2022-11-19 07:49:28,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:49:28,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:49:28,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:49:28,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:49:28,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:49:26" (1/3) ... [2022-11-19 07:49:28,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47302aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:28, skipping insertion in model container [2022-11-19 07:49:28,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:27" (2/3) ... [2022-11-19 07:49:28,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47302aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:28, skipping insertion in model container [2022-11-19 07:49:28,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:28" (3/3) ... [2022-11-19 07:49:28,422 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12-racy.i [2022-11-19 07:49:28,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:49:28,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:49:28,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-19 07:49:28,449 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:49:28,551 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:49:28,592 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:49:28,614 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 193 transitions, 396 flow [2022-11-19 07:49:28,625 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 193 transitions, 396 flow [2022-11-19 07:49:28,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-11-19 07:49:28,731 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-11-19 07:49:28,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:49:28,746 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 366 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-11-19 07:49:28,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 13080 [2022-11-19 07:49:34,168 INFO L134 LiptonReduction]: Checked pairs total: 14283 [2022-11-19 07:49:34,168 INFO L136 LiptonReduction]: Total number of compositions: 218 [2022-11-19 07:49:34,176 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 50 transitions, 110 flow [2022-11-19 07:49:34,294 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-11-19 07:49:34,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:49:34,318 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;@3424e790, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:49:34,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-19 07:49:34,325 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-11-19 07:49:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:49:34,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:34,330 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:49:34,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-19 07:49:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 777, now seen corresponding path program 1 times [2022-11-19 07:49:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:34,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704984564] [2022-11-19 07:49:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:34,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:34,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:49:34,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704984564] [2022-11-19 07:49:34,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704984564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:49:34,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:49:34,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:49:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533560652] [2022-11-19 07:49:34,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:49:34,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:49:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:49:34,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:49:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:49:34,503 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-11-19 07:49:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:49:34,550 INFO L93 Difference]: Finished difference Result 87 states and 251 transitions. [2022-11-19 07:49:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:49:34,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-19 07:49:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:49:34,562 INFO L225 Difference]: With dead ends: 87 [2022-11-19 07:49:34,563 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 07:49:34,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:49:34,567 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-11-19 07:49:34,568 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-11-19 07:49:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 07:49:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 07:49:34,610 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-11-19 07:49:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 203 transitions. [2022-11-19 07:49:34,616 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 203 transitions. Word has length 1 [2022-11-19 07:49:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:49:34,616 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 203 transitions. [2022-11-19 07:49:34,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:49:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 203 transitions. [2022-11-19 07:49:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:49:34,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:34,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:49:34,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:49:34,626 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-11-19 07:49:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1123045942, now seen corresponding path program 1 times [2022-11-19 07:49:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:34,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745901101] [2022-11-19 07:49:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:34,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:49:34,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745901101] [2022-11-19 07:49:34,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745901101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:49:34,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:49:34,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:49:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871110449] [2022-11-19 07:49:34,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:49:34,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:49:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:49:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:49:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:49:34,771 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-11-19 07:49:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:49:34,805 INFO L93 Difference]: Finished difference Result 80 states and 230 transitions. [2022-11-19 07:49:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:49:34,806 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-11-19 07:49:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:49:34,807 INFO L225 Difference]: With dead ends: 80 [2022-11-19 07:49:34,808 INFO L226 Difference]: Without dead ends: 80 [2022-11-19 07:49:34,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:49:34,809 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-11-19 07:49:34,810 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-11-19 07:49:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-19 07:49:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-19 07:49:34,818 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-11-19 07:49:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 230 transitions. [2022-11-19 07:49:34,819 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 230 transitions. Word has length 7 [2022-11-19 07:49:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:49:34,820 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 230 transitions. [2022-11-19 07:49:34,820 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-11-19 07:49:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 230 transitions. [2022-11-19 07:49:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 07:49:34,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:34,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:49:34,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:49:34,822 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-11-19 07:49:34,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash -454653754, now seen corresponding path program 1 times [2022-11-19 07:49:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:34,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117907589] [2022-11-19 07:49:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:34,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:49:34,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117907589] [2022-11-19 07:49:34,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117907589] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:49:34,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471962407] [2022-11-19 07:49:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:34,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:49:34,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:49:34,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:49:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:35,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:49:35,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:49:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:49:35,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:49:35,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471962407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:49:35,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:49:35,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 07:49:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657276817] [2022-11-19 07:49:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:49:35,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:49:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:49:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:49:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:49:35,146 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-11-19 07:49:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:49:35,208 INFO L93 Difference]: Finished difference Result 123 states and 355 transitions. [2022-11-19 07:49:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:49:35,209 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-11-19 07:49:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:49:35,210 INFO L225 Difference]: With dead ends: 123 [2022-11-19 07:49:35,211 INFO L226 Difference]: Without dead ends: 123 [2022-11-19 07:49:35,211 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-11-19 07:49:35,212 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:49:35,213 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.1s Time] [2022-11-19 07:49:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-19 07:49:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2022-11-19 07:49:35,235 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-11-19 07:49:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 239 transitions. [2022-11-19 07:49:35,237 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 239 transitions. Word has length 8 [2022-11-19 07:49:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:49:35,238 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 239 transitions. [2022-11-19 07:49:35,238 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-11-19 07:49:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 239 transitions. [2022-11-19 07:49:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:49:35,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:35,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:49:35,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 07:49:35,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:35,441 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-11-19 07:49:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash -814915347, now seen corresponding path program 1 times [2022-11-19 07:49:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:35,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071333261] [2022-11-19 07:49:35,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:35,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:49:35,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071333261] [2022-11-19 07:49:35,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071333261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:49:35,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847072837] [2022-11-19 07:49:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:35,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:35,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:49:35,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:49:35,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:49:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:35,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:49:35,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:49:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:35,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:49:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:35,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847072837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:49:35,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [906402812] [2022-11-19 07:49:35,721 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:49:35,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:49:35,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-19 07:49:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738279759] [2022-11-19 07:49:35,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:49:35,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:49:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:49:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:49:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:49:35,726 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-11-19 07:49:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:49:35,788 INFO L93 Difference]: Finished difference Result 110 states and 320 transitions. [2022-11-19 07:49:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:49:35,789 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-11-19 07:49:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:49:35,797 INFO L225 Difference]: With dead ends: 110 [2022-11-19 07:49:35,797 INFO L226 Difference]: Without dead ends: 110 [2022-11-19 07:49:35,798 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-11-19 07:49:35,799 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:49:35,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:49:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-19 07:49:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-19 07:49:35,811 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-11-19 07:49:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 320 transitions. [2022-11-19 07:49:35,812 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 320 transitions. Word has length 10 [2022-11-19 07:49:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:49:35,813 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 320 transitions. [2022-11-19 07:49:35,813 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-11-19 07:49:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 320 transitions. [2022-11-19 07:49:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:49:35,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:35,814 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:49:35,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-19 07:49:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:36,020 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-11-19 07:49:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1330887315, now seen corresponding path program 2 times [2022-11-19 07:49:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:36,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929858177] [2022-11-19 07:49:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:36,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:49:36,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929858177] [2022-11-19 07:49:36,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929858177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:49:36,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781909342] [2022-11-19 07:49:36,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:49:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:49:36,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:49:36,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:49:36,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 07:49:36,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:49:36,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:49:36,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:49:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:36,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:49:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:36,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781909342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:49:36,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1836473526] [2022-11-19 07:49:36,417 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:49:36,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:49:36,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-19 07:49:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128981193] [2022-11-19 07:49:36,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:49:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:49:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:49:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:49:36,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:49:36,424 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-11-19 07:49:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:49:36,563 INFO L93 Difference]: Finished difference Result 164 states and 482 transitions. [2022-11-19 07:49:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:49:36,565 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-11-19 07:49:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:49:36,570 INFO L225 Difference]: With dead ends: 164 [2022-11-19 07:49:36,570 INFO L226 Difference]: Without dead ends: 164 [2022-11-19 07:49:36,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:49:36,574 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:49:36,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 21 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:49:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-19 07:49:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-19 07:49:36,594 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-11-19 07:49:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 482 transitions. [2022-11-19 07:49:36,596 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 482 transitions. Word has length 13 [2022-11-19 07:49:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:49:36,597 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 482 transitions. [2022-11-19 07:49:36,597 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-11-19 07:49:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 482 transitions. [2022-11-19 07:49:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:49:36,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:36,599 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:49:36,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:49:36,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:36,812 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-11-19 07:49:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1053911699, now seen corresponding path program 3 times [2022-11-19 07:49:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:36,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095064865] [2022-11-19 07:49:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:37,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:49:37,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095064865] [2022-11-19 07:49:37,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095064865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:49:37,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843874352] [2022-11-19 07:49:37,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:49:37,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:49:37,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:49:37,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:49:37,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:49:37,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:49:37,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 07:49:37,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:49:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:37,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:49:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:37,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843874352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:49:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [173664543] [2022-11-19 07:49:37,526 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:49:37,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:49:37,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-19 07:49:37,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566280552] [2022-11-19 07:49:37,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:49:37,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-19 07:49:37,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:49:37,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-19 07:49:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:49:37,530 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-11-19 07:49:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:49:37,841 INFO L93 Difference]: Finished difference Result 272 states and 806 transitions. [2022-11-19 07:49:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 07:49:37,841 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-11-19 07:49:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:49:37,844 INFO L225 Difference]: With dead ends: 272 [2022-11-19 07:49:37,844 INFO L226 Difference]: Without dead ends: 272 [2022-11-19 07:49:37,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:49:37,846 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 351 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:49:37,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 15 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:49:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-19 07:49:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-11-19 07:49:37,876 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-11-19 07:49:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 806 transitions. [2022-11-19 07:49:37,879 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 806 transitions. Word has length 19 [2022-11-19 07:49:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:49:37,885 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 806 transitions. [2022-11-19 07:49:37,886 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-11-19 07:49:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 806 transitions. [2022-11-19 07:49:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-19 07:49:37,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:37,889 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:49:37,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:49:38,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:38,090 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-11-19 07:49:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 708785517, now seen corresponding path program 4 times [2022-11-19 07:49:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:38,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476883610] [2022-11-19 07:49:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:38,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:49:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476883610] [2022-11-19 07:49:38,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476883610] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:49:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852143083] [2022-11-19 07:49:38,677 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:49:38,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:49:38,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:49:38,679 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:49:38,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:49:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:49:38,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 07:49:38,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:49:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:38,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:49:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:49:39,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852143083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:49:39,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1328515113] [2022-11-19 07:49:39,319 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:49:39,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:49:39,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 29 [2022-11-19 07:49:39,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168112454] [2022-11-19 07:49:39,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:49:39,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 07:49:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:49:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 07:49:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:49:39,321 INFO L87 Difference]: Start difference. First operand 272 states and 806 transitions. Second operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:49:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:49:39,649 INFO L93 Difference]: Finished difference Result 308 states and 914 transitions. [2022-11-19 07:49:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-19 07:49:39,649 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-19 07:49:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:49:39,653 INFO L225 Difference]: With dead ends: 308 [2022-11-19 07:49:39,657 INFO L226 Difference]: Without dead ends: 308 [2022-11-19 07:49:39,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 20 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:49:39,658 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 366 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:49:39,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 21 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:49:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-19 07:49:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-11-19 07:49:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 306 states have (on average 2.9869281045751634) internal successors, (914), 307 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:49:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 914 transitions. [2022-11-19 07:49:39,683 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 914 transitions. Word has length 31 [2022-11-19 07:49:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:49:39,683 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 914 transitions. [2022-11-19 07:49:39,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:49:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 914 transitions. [2022-11-19 07:49:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:49:39,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:49:39,690 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:49:39,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:49:39,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 07:49:39,901 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-11-19 07:49:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:49:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1581640339, now seen corresponding path program 5 times [2022-11-19 07:49:39,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:49:39,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71031876] [2022-11-19 07:49:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:49:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:49:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:49:39,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:49:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:49:40,048 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:49:40,048 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:49:40,049 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-19 07:49:40,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-19 07:49:40,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-19 07:49:40,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-19 07:49:40,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-19 07:49:40,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-19 07:49:40,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-19 07:49:40,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-19 07:49:40,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-19 07:49:40,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-19 07:49:40,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-19 07:49:40,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-19 07:49:40,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-19 07:49:40,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-19 07:49:40,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-19 07:49:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-19 07:49:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-11-19 07:49:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-11-19 07:49:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-19 07:49:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-19 07:49:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-19 07:49:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-19 07:49:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-19 07:49:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-19 07:49:40,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-19 07:49:40,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-11-19 07:49:40,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-11-19 07:49:40,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-19 07:49:40,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-19 07:49:40,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-19 07:49:40,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-19 07:49:40,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-19 07:49:40,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-19 07:49:40,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-19 07:49:40,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-19 07:49:40,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-19 07:49:40,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-19 07:49:40,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-19 07:49:40,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-19 07:49:40,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-19 07:49:40,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-19 07:49:40,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-19 07:49:40,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-19 07:49:40,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-19 07:49:40,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-19 07:49:40,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-19 07:49:40,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:49:40,078 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-11-19 07:49:40,084 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:49:40,084 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:49:40,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:49:40 BasicIcfg [2022-11-19 07:49:40,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:49:40,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:49:40,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:49:40,195 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:49:40,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:28" (3/4) ... [2022-11-19 07:49:40,198 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:49:40,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:49:40,199 INFO L158 Benchmark]: Toolchain (without parser) took 13322.85ms. Allocated memory was 121.6MB in the beginning and 192.9MB in the end (delta: 71.3MB). Free memory was 90.1MB in the beginning and 146.6MB in the end (delta: -56.5MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-11-19 07:49:40,200 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:49:40,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.87ms. Allocated memory is still 121.6MB. Free memory was 89.8MB in the beginning and 87.5MB in the end (delta: 2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-19 07:49:40,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.59ms. Allocated memory is still 121.6MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:49:40,200 INFO L158 Benchmark]: Boogie Preprocessor took 68.72ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:49:40,201 INFO L158 Benchmark]: RCFGBuilder took 782.51ms. Allocated memory is still 121.6MB. Free memory was 83.6MB in the beginning and 98.3MB in the end (delta: -14.8MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2022-11-19 07:49:40,201 INFO L158 Benchmark]: TraceAbstraction took 11773.68ms. Allocated memory was 121.6MB in the beginning and 192.9MB in the end (delta: 71.3MB). Free memory was 97.7MB in the beginning and 146.6MB in the end (delta: -48.9MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2022-11-19 07:49:40,202 INFO L158 Benchmark]: Witness Printer took 11.53ms. Allocated memory is still 192.9MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:49:40,204 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.87ms. Allocated memory is still 121.6MB. Free memory was 89.8MB in the beginning and 87.5MB in the end (delta: 2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.59ms. Allocated memory is still 121.6MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.72ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 782.51ms. Allocated memory is still 121.6MB. Free memory was 83.6MB in the beginning and 98.3MB in the end (delta: -14.8MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11773.68ms. Allocated memory was 121.6MB in the beginning and 192.9MB in the end (delta: 71.3MB). Free memory was 97.7MB in the beginning and 146.6MB in the end (delta: -48.9MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. * Witness Printer took 11.53ms. Allocated memory is still 192.9MB. Free memory is still 146.6MB. 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: 5.5s, 192 PlacesBefore, 53 PlacesAfterwards, 193 TransitionsBefore, 50 TransitionsAfterwards, 13080 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 165 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 218 TotalNumberOfCompositions, 14283 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12363, independent: 12250, independent conditional: 0, independent unconditional: 12250, 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: 8102, independent: 8044, independent conditional: 0, independent unconditional: 8044, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8102, independent: 7936, independent conditional: 0, independent unconditional: 7936, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 166, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 303, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12363, independent: 4206, independent conditional: 0, independent unconditional: 4206, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 8102, unknown conditional: 0, unknown unconditional: 8102] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, 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: [L703] 0 int cur = 1, prev = 0, next = 0; [L683] 0 int i, j; [L686] 0 int p, q; [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)=196419, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-2, 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)=196419, arg={0:0}, arg={0:0}, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-1, 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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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 < 26 [L706] COND TRUE 0 x < 26 [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=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [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=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] 0 x < 26 [L706] COND FALSE 0 !(x < 26) [L711] 0 return prev; [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); [L725] 0 i < correct VAL [\old(argc)=196419, arg={0:0}, arg={0:0}, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, correct=121393, cur=196418, i=1, id1={5:0}, id2={3:0}, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p < 12 [L688] COND TRUE 1 p < 12 [L690] EXPR 1 i + j [L690] 1 i = i + j [L688] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=2, j=1, next=196418, p=1, prev=121393, q=0, x=26] [L725] 0 i < correct VAL [\old(argc)=196419, arg={0:0}, arg={0:0}, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, correct=121393, cur=196418, i=2, id1={5:0}, id2={3:0}, j=1, next=196418, p=1, prev=121393, q=0, x=26] 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: 11.5s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 611 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 21 mSDtfsCounter, 611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 111 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2122occurred in iteration=0, InterpolantAutomatonStates: 78, 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.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 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-11-19 07:49:40,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6ab41cc-3018-4a44-8962-4b163405bba8/bin/utaipan-I9t0OCRTmS/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