./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 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_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 963fe2b49296fadf7c892a862a5472be95dcc4e457bf5d1be114d7bd124d5424 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 11:07:19,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:07:19,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:07:19,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:07:19,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:07:19,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:07:19,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:07:19,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:07:19,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:07:19,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:07:19,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:07:19,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:07:19,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:07:19,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:07:19,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:07:19,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:07:19,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:07:19,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:07:19,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:07:19,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:07:19,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:07:19,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:07:19,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:07:19,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:07:19,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:07:19,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:07:19,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:07:19,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:07:19,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:07:19,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:07:19,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:07:19,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:07:19,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:07:19,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:07:19,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:07:19,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:07:19,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:07:19,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:07:19,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:07:19,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:07:19,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:07:19,112 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-12-13 11:07:19,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:07:19,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:07:19,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:07:19,131 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:07:19,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:07:19,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:07:19,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:07:19,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:07:19,133 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:07:19,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:07:19,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:07:19,148 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:07:19,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:07:19,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:07:19,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:07:19,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:07:19,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:07:19,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:07:19,150 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 11:07:19,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:07:19,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:07:19,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:07:19,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:07:19,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:07:19,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:07:19,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:07:19,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:07:19,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:07:19,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:07:19,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:07:19,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:07:19,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:07:19,152 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:07:19,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:07:19,153 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:07:19,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:07:19,153 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:07:19,153 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/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_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> 963fe2b49296fadf7c892a862a5472be95dcc4e457bf5d1be114d7bd124d5424 [2022-12-13 11:07:19,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:07:19,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:07:19,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:07:19,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:07:19,376 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:07:19,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-b.i [2022-12-13 11:07:21,943 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:07:22,153 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:07:22,154 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-b.i [2022-12-13 11:07:22,165 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/data/abea8f2a7/12c99df40b014c7f9737739317bc0c09/FLAGda98a0644 [2022-12-13 11:07:22,512 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/data/abea8f2a7/12c99df40b014c7f9737739317bc0c09 [2022-12-13 11:07:22,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:07:22,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:07:22,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:07:22,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:07:22,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:07:22,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244b6ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22, skipping insertion in model container [2022-12-13 11:07:22,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:07:22,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:07:22,774 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-b.i[30403,30416] [2022-12-13 11:07:22,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:07:22,784 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:07:22,811 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-b.i[30403,30416] [2022-12-13 11:07:22,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:07:22,837 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:07:22,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22 WrapperNode [2022-12-13 11:07:22,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:07:22,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:07:22,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:07:22,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:07:22,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,870 INFO L138 Inliner]: procedures = 172, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2022-12-13 11:07:22,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:07:22,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:07:22,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:07:22,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:07:22,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,889 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:07:22,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:07:22,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:07:22,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:07:22,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (1/1) ... [2022-12-13 11:07:22,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:07:22,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:07:22,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:07:22,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:07:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-13 11:07:22,947 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-13 11:07:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:07:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:07:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:07:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:07:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:07:22,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:07:22,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:07:22,948 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 11:07:23,045 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:07:23,047 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:07:23,183 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:07:23,242 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:07:23,242 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 11:07:23,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:07:23 BoogieIcfgContainer [2022-12-13 11:07:23,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:07:23,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:07:23,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:07:23,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:07:23,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:07:22" (1/3) ... [2022-12-13 11:07:23,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ac0923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:07:23, skipping insertion in model container [2022-12-13 11:07:23,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:07:22" (2/3) ... [2022-12-13 11:07:23,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ac0923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:07:23, skipping insertion in model container [2022-12-13 11:07:23,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:07:23" (3/3) ... [2022-12-13 11:07:23,252 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs-b.i [2022-12-13 11:07:23,260 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 11:07:23,269 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:07:23,269 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-12-13 11:07:23,269 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:07:23,309 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:07:23,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions, 177 flow [2022-12-13 11:07:23,396 INFO L130 PetriNetUnfolder]: 5/97 cut-off events. [2022-12-13 11:07:23,396 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:23,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 97 events. 5/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2022-12-13 11:07:23,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 86 transitions, 177 flow [2022-12-13 11:07:23,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 86 transitions, 177 flow [2022-12-13 11:07:23,407 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:07:23,415 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 86 transitions, 177 flow [2022-12-13 11:07:23,417 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 86 transitions, 177 flow [2022-12-13 11:07:23,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions, 177 flow [2022-12-13 11:07:23,431 INFO L130 PetriNetUnfolder]: 5/97 cut-off events. [2022-12-13 11:07:23,432 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:23,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 97 events. 5/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2022-12-13 11:07:23,433 INFO L119 LiptonReduction]: Number of co-enabled transitions 1568 [2022-12-13 11:07:24,935 INFO L134 LiptonReduction]: Checked pairs total: 1366 [2022-12-13 11:07:24,935 INFO L136 LiptonReduction]: Total number of compositions: 91 [2022-12-13 11:07:24,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:07:24,951 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=PETRI_NET, 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;@77934ed4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:07:24,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-12-13 11:07:24,953 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 11:07:24,954 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:24,954 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:24,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 11:07:24,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-12-13 11:07:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash 13772409, now seen corresponding path program 1 times [2022-12-13 11:07:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:24,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721104599] [2022-12-13 11:07:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:24,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:25,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721104599] [2022-12-13 11:07:25,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721104599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:25,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:25,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:07:25,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839720322] [2022-12-13 11:07:25,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:25,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:07:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:25,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:07:25,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:07:25,099 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 177 [2022-12-13 11:07:25,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 37 flow. Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:25,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:25,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 177 [2022-12-13 11:07:25,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:25,117 INFO L130 PetriNetUnfolder]: 7/19 cut-off events. [2022-12-13 11:07:25,117 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:25,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 7/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2022-12-13 11:07:25,118 INFO L137 encePairwiseOnDemand]: 169/177 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2022-12-13 11:07:25,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 35 flow [2022-12-13 11:07:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:07:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:07:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 163 transitions. [2022-12-13 11:07:25,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4604519774011299 [2022-12-13 11:07:25,127 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 163 transitions. [2022-12-13 11:07:25,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 163 transitions. [2022-12-13 11:07:25,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:07:25,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 163 transitions. [2022-12-13 11:07:25,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:25,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:25,135 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:25,136 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 37 flow. Second operand 2 states and 163 transitions. [2022-12-13 11:07:25,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 35 flow [2022-12-13 11:07:25,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:07:25,139 INFO L231 Difference]: Finished difference. Result has 11 places, 8 transitions, 21 flow [2022-12-13 11:07:25,140 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=21, PETRI_PLACES=11, PETRI_TRANSITIONS=8} [2022-12-13 11:07:25,143 INFO L288 CegarLoopForPetriNet]: 18 programPoint places, -7 predicate places. [2022-12-13 11:07:25,143 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 21 flow [2022-12-13 11:07:25,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:25,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:25,144 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-12-13 11:07:25,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:07:25,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-12-13 11:07:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 350344035, now seen corresponding path program 1 times [2022-12-13 11:07:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:25,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817512215] [2022-12-13 11:07:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:07:25,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:07:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:07:25,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:07:25,179 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:07:25,181 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2022-12-13 11:07:25,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-12-13 11:07:25,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-12-13 11:07:25,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-12-13 11:07:25,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-12-13 11:07:25,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-12-13 11:07:25,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2022-12-13 11:07:25,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-12-13 11:07:25,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-12-13 11:07:25,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-12-13 11:07:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-12-13 11:07:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-12-13 11:07:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-12-13 11:07:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-12-13 11:07:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-12-13 11:07:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:07:25,188 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 11:07:25,190 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 11:07:25,191 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-13 11:07:25,207 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:07:25,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 143 transitions, 298 flow [2022-12-13 11:07:25,230 INFO L130 PetriNetUnfolder]: 9/167 cut-off events. [2022-12-13 11:07:25,230 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:07:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 167 events. 9/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 296 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 125. Up to 6 conditions per place. [2022-12-13 11:07:25,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 143 transitions, 298 flow [2022-12-13 11:07:25,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 143 transitions, 298 flow [2022-12-13 11:07:25,233 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:07:25,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 143 transitions, 298 flow [2022-12-13 11:07:25,233 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 143 transitions, 298 flow [2022-12-13 11:07:25,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 143 transitions, 298 flow [2022-12-13 11:07:25,250 INFO L130 PetriNetUnfolder]: 9/167 cut-off events. [2022-12-13 11:07:25,250 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:07:25,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 167 events. 9/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 296 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 125. Up to 6 conditions per place. [2022-12-13 11:07:25,254 INFO L119 LiptonReduction]: Number of co-enabled transitions 9520 [2022-12-13 11:07:26,721 INFO L134 LiptonReduction]: Checked pairs total: 18016 [2022-12-13 11:07:26,722 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-12-13 11:07:26,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:07:26,725 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=PETRI_NET, 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;@77934ed4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:07:26,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-12-13 11:07:26,727 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 11:07:26,727 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:26,727 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:26,728 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:07:26,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-12-13 11:07:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 737209409, now seen corresponding path program 1 times [2022-12-13 11:07:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:26,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847887840] [2022-12-13 11:07:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:26,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:26,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847887840] [2022-12-13 11:07:26,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847887840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:26,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:26,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:07:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225157432] [2022-12-13 11:07:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:26,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:07:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:26,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:07:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:07:26,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 261 [2022-12-13 11:07:26,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:26,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:26,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 261 [2022-12-13 11:07:26,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:26,919 INFO L130 PetriNetUnfolder]: 564/1020 cut-off events. [2022-12-13 11:07:26,919 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 11:07:26,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1020 events. 564/1020 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5665 event pairs, 208 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 1568. Up to 632 conditions per place. [2022-12-13 11:07:26,924 INFO L137 encePairwiseOnDemand]: 237/261 looper letters, 46 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2022-12-13 11:07:26,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 253 flow [2022-12-13 11:07:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:07:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:07:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-12-13 11:07:26,926 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.51213282247765 [2022-12-13 11:07:26,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2022-12-13 11:07:26,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2022-12-13 11:07:26,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:07:26,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2022-12-13 11:07:26,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:26,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:26,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:26,930 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 106 flow. Second operand 3 states and 401 transitions. [2022-12-13 11:07:26,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 253 flow [2022-12-13 11:07:26,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 251 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 11:07:26,932 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 172 flow [2022-12-13 11:07:26,932 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2022-12-13 11:07:26,932 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2022-12-13 11:07:26,933 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 172 flow [2022-12-13 11:07:26,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:26,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:26,933 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-12-13 11:07:26,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:07:26,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-12-13 11:07:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1099426023, now seen corresponding path program 1 times [2022-12-13 11:07:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:26,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297527827] [2022-12-13 11:07:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:07:26,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:07:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:07:26,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:07:26,965 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:07:26,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2022-12-13 11:07:26,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-12-13 11:07:26,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-12-13 11:07:26,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-12-13 11:07:26,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-12-13 11:07:26,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-12-13 11:07:26,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-12-13 11:07:26,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-12-13 11:07:26,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-12-13 11:07:26,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-12-13 11:07:26,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2022-12-13 11:07:26,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-12-13 11:07:26,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-12-13 11:07:26,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-12-13 11:07:26,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-12-13 11:07:26,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-12-13 11:07:26,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-12-13 11:07:26,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-12-13 11:07:26,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-12-13 11:07:26,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-12-13 11:07:26,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-12-13 11:07:26,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-12-13 11:07:26,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:07:26,969 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 11:07:26,970 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 11:07:26,970 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-12-13 11:07:26,997 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:07:27,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 200 transitions, 421 flow [2022-12-13 11:07:27,038 INFO L130 PetriNetUnfolder]: 13/237 cut-off events. [2022-12-13 11:07:27,038 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:07:27,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 237 events. 13/237 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 611 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2022-12-13 11:07:27,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 200 transitions, 421 flow [2022-12-13 11:07:27,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 200 transitions, 421 flow [2022-12-13 11:07:27,045 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:07:27,045 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 200 transitions, 421 flow [2022-12-13 11:07:27,045 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 200 transitions, 421 flow [2022-12-13 11:07:27,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 200 transitions, 421 flow [2022-12-13 11:07:27,085 INFO L130 PetriNetUnfolder]: 13/237 cut-off events. [2022-12-13 11:07:27,086 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:07:27,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 237 events. 13/237 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 611 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2022-12-13 11:07:27,110 INFO L119 LiptonReduction]: Number of co-enabled transitions 23856 [2022-12-13 11:07:29,008 INFO L134 LiptonReduction]: Checked pairs total: 48261 [2022-12-13 11:07:29,009 INFO L136 LiptonReduction]: Total number of compositions: 170 [2022-12-13 11:07:29,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:07:29,010 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=PETRI_NET, 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;@77934ed4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:07:29,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-12-13 11:07:29,012 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 11:07:29,012 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:29,012 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:29,012 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:07:29,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-12-13 11:07:29,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1142322904, now seen corresponding path program 1 times [2022-12-13 11:07:29,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:29,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309661285] [2022-12-13 11:07:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:29,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309661285] [2022-12-13 11:07:29,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309661285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:29,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:29,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:07:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146600522] [2022-12-13 11:07:29,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:29,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:07:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:07:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:07:29,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 370 [2022-12-13 11:07:29,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:29,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:29,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 370 [2022-12-13 11:07:29,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:30,407 INFO L130 PetriNetUnfolder]: 11854/18209 cut-off events. [2022-12-13 11:07:30,407 INFO L131 PetriNetUnfolder]: For 1108/1108 co-relation queries the response was YES. [2022-12-13 11:07:30,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36157 conditions, 18209 events. 11854/18209 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 130944 event pairs, 4794 based on Foata normal form. 0/15899 useless extension candidates. Maximal degree in co-relation 23372. Up to 11234 conditions per place. [2022-12-13 11:07:30,567 INFO L137 encePairwiseOnDemand]: 335/370 looper letters, 65 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2022-12-13 11:07:30,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 371 flow [2022-12-13 11:07:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:07:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:07:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2022-12-13 11:07:30,572 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 11:07:30,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2022-12-13 11:07:30,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2022-12-13 11:07:30,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:07:30,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2022-12-13 11:07:30,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:30,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:30,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:30,583 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 155 flow. Second operand 3 states and 555 transitions. [2022-12-13 11:07:30,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 371 flow [2022-12-13 11:07:30,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 363 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 11:07:30,589 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 253 flow [2022-12-13 11:07:30,589 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2022-12-13 11:07:30,590 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2022-12-13 11:07:30,590 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 253 flow [2022-12-13 11:07:30,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:30,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:30,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:07:30,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:07:30,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-12-13 11:07:30,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1174550708, now seen corresponding path program 1 times [2022-12-13 11:07:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:30,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529337956] [2022-12-13 11:07:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529337956] [2022-12-13 11:07:30,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529337956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:30,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:30,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:07:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971644906] [2022-12-13 11:07:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:30,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:07:30,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:30,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:07:30,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:07:30,673 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 370 [2022-12-13 11:07:30,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:30,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:30,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 370 [2022-12-13 11:07:30,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:32,056 INFO L130 PetriNetUnfolder]: 12719/20088 cut-off events. [2022-12-13 11:07:32,057 INFO L131 PetriNetUnfolder]: For 5560/5566 co-relation queries the response was YES. [2022-12-13 11:07:32,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46541 conditions, 20088 events. 12719/20088 cut-off events. For 5560/5566 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 149433 event pairs, 7078 based on Foata normal form. 0/17642 useless extension candidates. Maximal degree in co-relation 31822. Up to 14469 conditions per place. [2022-12-13 11:07:32,131 INFO L137 encePairwiseOnDemand]: 360/370 looper letters, 57 selfloop transitions, 16 changer transitions 0/98 dead transitions. [2022-12-13 11:07:32,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 505 flow [2022-12-13 11:07:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:07:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:07:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2022-12-13 11:07:32,135 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46936936936936935 [2022-12-13 11:07:32,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2022-12-13 11:07:32,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2022-12-13 11:07:32,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:07:32,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2022-12-13 11:07:32,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:32,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:32,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:32,138 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 253 flow. Second operand 3 states and 521 transitions. [2022-12-13 11:07:32,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 505 flow [2022-12-13 11:07:32,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:07:32,187 INFO L231 Difference]: Finished difference. Result has 63 places, 82 transitions, 369 flow [2022-12-13 11:07:32,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=63, PETRI_TRANSITIONS=82} [2022-12-13 11:07:32,188 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2022-12-13 11:07:32,188 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 82 transitions, 369 flow [2022-12-13 11:07:32,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:32,188 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:32,188 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-12-13 11:07:32,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:07:32,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2022-12-13 11:07:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash 464449522, now seen corresponding path program 1 times [2022-12-13 11:07:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:32,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281220957] [2022-12-13 11:07:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:32,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:07:32,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:07:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:07:32,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:07:32,240 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:07:32,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2022-12-13 11:07:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2022-12-13 11:07:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2022-12-13 11:07:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2022-12-13 11:07:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2022-12-13 11:07:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2022-12-13 11:07:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2022-12-13 11:07:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2022-12-13 11:07:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2022-12-13 11:07:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2022-12-13 11:07:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2022-12-13 11:07:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2022-12-13 11:07:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2022-12-13 11:07:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2022-12-13 11:07:32,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2022-12-13 11:07:32,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2022-12-13 11:07:32,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2022-12-13 11:07:32,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2022-12-13 11:07:32,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2022-12-13 11:07:32,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2022-12-13 11:07:32,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2022-12-13 11:07:32,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2022-12-13 11:07:32,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2022-12-13 11:07:32,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2022-12-13 11:07:32,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2022-12-13 11:07:32,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2022-12-13 11:07:32,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2022-12-13 11:07:32,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2022-12-13 11:07:32,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2022-12-13 11:07:32,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:07:32,245 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 11:07:32,246 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 11:07:32,246 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-12-13 11:07:32,277 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:07:32,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 257 transitions, 546 flow [2022-12-13 11:07:32,321 INFO L130 PetriNetUnfolder]: 17/307 cut-off events. [2022-12-13 11:07:32,322 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 11:07:32,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 307 events. 17/307 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 963 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 245. Up to 10 conditions per place. [2022-12-13 11:07:32,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 257 transitions, 546 flow [2022-12-13 11:07:32,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 257 transitions, 546 flow [2022-12-13 11:07:32,326 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:07:32,327 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 257 transitions, 546 flow [2022-12-13 11:07:32,327 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 257 transitions, 546 flow [2022-12-13 11:07:32,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 257 transitions, 546 flow [2022-12-13 11:07:32,367 INFO L130 PetriNetUnfolder]: 17/307 cut-off events. [2022-12-13 11:07:32,368 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 11:07:32,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 307 events. 17/307 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 963 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 245. Up to 10 conditions per place. [2022-12-13 11:07:32,382 INFO L119 LiptonReduction]: Number of co-enabled transitions 44576 [2022-12-13 11:07:34,697 INFO L134 LiptonReduction]: Checked pairs total: 88261 [2022-12-13 11:07:34,697 INFO L136 LiptonReduction]: Total number of compositions: 212 [2022-12-13 11:07:34,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:07:34,699 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=PETRI_NET, 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;@77934ed4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:07:34,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-12-13 11:07:34,700 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-13 11:07:34,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:07:34,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:34,701 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 11:07:34,701 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2022-12-13 11:07:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash 52911380, now seen corresponding path program 1 times [2022-12-13 11:07:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:34,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166077207] [2022-12-13 11:07:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:34,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166077207] [2022-12-13 11:07:34,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166077207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:34,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:34,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:07:34,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633879414] [2022-12-13 11:07:34,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:34,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:07:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:07:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:07:34,718 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 469 [2022-12-13 11:07:34,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 210 flow. Second operand has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:34,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:34,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 469 [2022-12-13 11:07:34,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:07:37,474 INFO L130 PetriNetUnfolder]: 28015/40487 cut-off events. [2022-12-13 11:07:37,474 INFO L131 PetriNetUnfolder]: For 5418/5418 co-relation queries the response was YES. [2022-12-13 11:07:37,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79635 conditions, 40487 events. 28015/40487 cut-off events. For 5418/5418 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 278577 event pairs, 23919 based on Foata normal form. 1170/36002 useless extension candidates. Maximal degree in co-relation 9033. Up to 36208 conditions per place. [2022-12-13 11:07:37,649 INFO L137 encePairwiseOnDemand]: 449/469 looper letters, 37 selfloop transitions, 0 changer transitions 0/69 dead transitions. [2022-12-13 11:07:37,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 69 transitions, 244 flow [2022-12-13 11:07:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:07:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:07:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 487 transitions. [2022-12-13 11:07:37,651 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5191897654584222 [2022-12-13 11:07:37,651 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 487 transitions. [2022-12-13 11:07:37,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 487 transitions. [2022-12-13 11:07:37,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:07:37,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 487 transitions. [2022-12-13 11:07:37,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:37,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 469.0) internal successors, (1407), 3 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:37,654 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 469.0) internal successors, (1407), 3 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:37,654 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 210 flow. Second operand 2 states and 487 transitions. [2022-12-13 11:07:37,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 69 transitions, 244 flow [2022-12-13 11:07:37,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 232 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-13 11:07:37,657 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 158 flow [2022-12-13 11:07:37,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2022-12-13 11:07:37,657 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, -16 predicate places. [2022-12-13 11:07:37,657 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 158 flow [2022-12-13 11:07:37,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:37,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:07:37,658 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:07:37,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:07:37,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2022-12-13 11:07:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:07:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1640253819, now seen corresponding path program 1 times [2022-12-13 11:07:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:07:37,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297028721] [2022-12-13 11:07:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:07:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:07:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:07:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:07:37,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:07:37,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297028721] [2022-12-13 11:07:37,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297028721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:07:37,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:07:37,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:07:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001798179] [2022-12-13 11:07:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:07:37,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:07:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:07:37,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:07:37,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:07:37,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 469 [2022-12-13 11:07:37,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:07:37,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:07:37,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 469 [2022-12-13 11:07:37,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:00,638 INFO L130 PetriNetUnfolder]: 259778/355536 cut-off events. [2022-12-13 11:08:00,638 INFO L131 PetriNetUnfolder]: For 8327/8327 co-relation queries the response was YES. [2022-12-13 11:08:01,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707088 conditions, 355536 events. 259778/355536 cut-off events. For 8327/8327 co-relation queries the response was YES. Maximal size of possible extension queue 11494. Compared 2815976 event pairs, 104209 based on Foata normal form. 0/311431 useless extension candidates. Maximal degree in co-relation 707081. Up to 208071 conditions per place. [2022-12-13 11:08:02,585 INFO L137 encePairwiseOnDemand]: 441/469 looper letters, 86 selfloop transitions, 20 changer transitions 0/117 dead transitions. [2022-12-13 11:08:02,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 117 transitions, 481 flow [2022-12-13 11:08:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:08:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:08:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2022-12-13 11:08:02,589 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47974413646055436 [2022-12-13 11:08:02,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 675 transitions. [2022-12-13 11:08:02,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 675 transitions. [2022-12-13 11:08:02,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:08:02,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 675 transitions. [2022-12-13 11:08:02,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:02,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:02,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:02,594 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 158 flow. Second operand 3 states and 675 transitions. [2022-12-13 11:08:02,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 117 transitions, 481 flow [2022-12-13 11:08:02,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 481 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:08:02,600 INFO L231 Difference]: Finished difference. Result has 79 places, 89 transitions, 334 flow [2022-12-13 11:08:02,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=79, PETRI_TRANSITIONS=89} [2022-12-13 11:08:02,600 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, -12 predicate places. [2022-12-13 11:08:02,600 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 334 flow [2022-12-13 11:08:02,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:02,601 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:02,601 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:02,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:08:02,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2022-12-13 11:08:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1392191633, now seen corresponding path program 1 times [2022-12-13 11:08:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:02,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752125316] [2022-12-13 11:08:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:08:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:02,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752125316] [2022-12-13 11:08:02,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752125316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:08:02,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:08:02,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:08:02,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328341737] [2022-12-13 11:08:02,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:08:02,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:08:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:02,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:08:02,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:08:02,667 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 469 [2022-12-13 11:08:02,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:02,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:02,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 469 [2022-12-13 11:08:02,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:26,926 INFO L130 PetriNetUnfolder]: 264696/372841 cut-off events. [2022-12-13 11:08:26,926 INFO L131 PetriNetUnfolder]: For 139675/139848 co-relation queries the response was YES. [2022-12-13 11:08:27,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889697 conditions, 372841 events. 264696/372841 cut-off events. For 139675/139848 co-relation queries the response was YES. Maximal size of possible extension queue 12243. Compared 3135339 event pairs, 152481 based on Foata normal form. 2/322385 useless extension candidates. Maximal degree in co-relation 889688. Up to 288832 conditions per place. [2022-12-13 11:08:29,668 INFO L137 encePairwiseOnDemand]: 456/469 looper letters, 76 selfloop transitions, 22 changer transitions 0/131 dead transitions. [2022-12-13 11:08:29,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 131 transitions, 683 flow [2022-12-13 11:08:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:08:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:08:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2022-12-13 11:08:29,672 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47761194029850745 [2022-12-13 11:08:29,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 672 transitions. [2022-12-13 11:08:29,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 672 transitions. [2022-12-13 11:08:29,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:08:29,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 672 transitions. [2022-12-13 11:08:29,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:29,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:29,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:29,677 INFO L175 Difference]: Start difference. First operand has 79 places, 89 transitions, 334 flow. Second operand 3 states and 672 transitions. [2022-12-13 11:08:29,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 131 transitions, 683 flow [2022-12-13 11:08:33,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 131 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:08:33,781 INFO L231 Difference]: Finished difference. Result has 81 places, 109 transitions, 500 flow [2022-12-13 11:08:33,782 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=81, PETRI_TRANSITIONS=109} [2022-12-13 11:08:33,782 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, -10 predicate places. [2022-12-13 11:08:33,782 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 109 transitions, 500 flow [2022-12-13 11:08:33,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:33,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:08:33,782 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:08:33,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:08:33,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2022-12-13 11:08:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:08:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1371980356, now seen corresponding path program 1 times [2022-12-13 11:08:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:08:33,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128384679] [2022-12-13 11:08:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:08:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:08:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:08:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 11:08:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:08:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128384679] [2022-12-13 11:08:33,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128384679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:08:33,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:08:33,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:08:33,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532600984] [2022-12-13 11:08:33,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:08:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:08:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:08:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:08:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:08:33,847 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 469 [2022-12-13 11:08:33,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 109 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:08:33,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:08:33,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 469 [2022-12-13 11:08:33,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:08:40,048 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 62#L709-2true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 200#L709-1true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:40,048 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 11:08:40,048 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 11:08:40,048 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 11:08:40,048 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 11:08:41,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 62#L709-2true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 51#L709-2true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:41,285 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 11:08:41,285 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 11:08:41,285 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 11:08:41,285 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 11:08:43,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [104#L725-4true, Black: 261#(= |#race~seed~0| 0), 62#L709-2true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 200#L709-1true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:43,304 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 11:08:43,304 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:43,304 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:43,304 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,149 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1277] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][37], [189#L711true, Black: 259#true, 148#L725-5true, 62#L709-2true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 180#L713-1true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:44,150 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,150 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,150 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,150 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,150 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 62#L709-2true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, 188#L710-1true, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:44,150 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,150 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,150 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,150 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 11:08:44,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [104#L725-4true, Black: 261#(= |#race~seed~0| 0), 62#L709-2true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 51#L709-2true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, 64#L713-3true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:44,890 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 11:08:44,890 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 11:08:44,891 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 11:08:44,891 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 11:08:48,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1277] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][37], [189#L711true, Black: 259#true, 104#L725-4true, 62#L709-2true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 180#L713-1true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:48,094 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2022-12-13 11:08:48,094 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 11:08:48,094 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 11:08:48,094 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 11:08:48,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [104#L725-4true, Black: 261#(= |#race~seed~0| 0), 62#L709-2true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, 188#L710-1true, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:48,094 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2022-12-13 11:08:48,094 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 11:08:48,094 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 11:08:48,095 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 11:08:52,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [229#L711true, Black: 259#true, 79#L714true, 148#L725-5true, 56#L711-1true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:52,101 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 11:08:52,101 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:52,101 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:52,101 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:52,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [110#L711-1true, Black: 259#true, 229#L711true, 148#L725-5true, 53#L714true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:52,411 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 11:08:52,411 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:52,411 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:52,411 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:53,585 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [229#L711true, Black: 259#true, 148#L725-5true, 56#L711-1true, 109#thr1EXITtrue, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:53,585 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2022-12-13 11:08:53,585 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 11:08:53,585 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 11:08:53,585 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 11:08:53,654 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1445] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][23], [235#L711-1true, Black: 259#true, 79#L714true, 47#L711true, 148#L725-5true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:53,654 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 11:08:53,655 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:53,655 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:53,655 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 11:08:53,918 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [24#thr1EXITtrue, 110#L711-1true, 229#L711true, Black: 259#true, 148#L725-5true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:53,918 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2022-12-13 11:08:53,918 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 11:08:53,918 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 11:08:53,918 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 11:08:55,227 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][63], [110#L711-1true, Black: 259#true, 229#L711true, 53#L714true, 148#L725-5true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:55,227 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event [2022-12-13 11:08:55,227 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2022-12-13 11:08:55,227 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2022-12-13 11:08:55,227 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2022-12-13 11:08:55,759 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [Black: 259#true, 229#L711true, 104#L725-4true, 79#L714true, 56#L711-1true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:55,759 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2022-12-13 11:08:55,759 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:55,759 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:55,759 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:56,093 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [110#L711-1true, 104#L725-4true, Black: 259#true, 229#L711true, 53#L714true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:56,093 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2022-12-13 11:08:56,093 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:56,093 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:56,093 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:56,513 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][63], [24#thr1EXITtrue, 110#L711-1true, Black: 259#true, 229#L711true, 148#L725-5true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:56,513 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2022-12-13 11:08:56,513 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2022-12-13 11:08:56,513 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2022-12-13 11:08:56,514 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2022-12-13 11:08:56,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1445] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][23], [235#L711-1true, Black: 259#true, 47#L711true, 148#L725-5true, 109#thr1EXITtrue, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:56,552 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2022-12-13 11:08:56,552 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2022-12-13 11:08:56,552 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2022-12-13 11:08:56,552 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2022-12-13 11:08:57,006 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [104#L725-4true, 229#L711true, Black: 259#true, 56#L711-1true, 109#thr1EXITtrue, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:57,006 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,006 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,006 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,006 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1445] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][23], [235#L711-1true, Black: 259#true, 104#L725-4true, 79#L714true, 47#L711true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:57,115 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2022-12-13 11:08:57,115 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:57,115 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:57,115 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 11:08:57,401 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][127], [24#thr1EXITtrue, 110#L711-1true, Black: 259#true, 229#L711true, 104#L725-4true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:57,401 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,401 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,401 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,401 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,771 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][107], [235#L711-1true, 79#L714true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:57,771 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,771 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,771 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,772 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1577] L713-1-->L713-3: Formula: (= |v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_176|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_176|, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][132], [114#L713-3true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 56#L711-1true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 150#L714true, 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:57,794 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,794 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,794 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:57,794 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][63], [110#L711-1true, 229#L711true, Black: 259#true, 104#L725-4true, 53#L714true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:58,100 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is not cut-off event [2022-12-13 11:08:58,100 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is not cut-off event [2022-12-13 11:08:58,100 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is not cut-off event [2022-12-13 11:08:58,100 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is not cut-off event [2022-12-13 11:08:58,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, 79#L714true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:58,691 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,691 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,691 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,691 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,703 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, 79#L714true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:58,703 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,703 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,703 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,703 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,704 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 11:08:58,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][107], [235#L711-1true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 109#thr1EXITtrue, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:58,709 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2022-12-13 11:08:58,709 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:58,709 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:58,709 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:58,729 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1577] L713-1-->L713-3: Formula: (= |v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_176|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_176|, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][132], [114#L713-3true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 56#L711-1true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 89#thr1EXITtrue, 256#true]) [2022-12-13 11:08:58,729 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2022-12-13 11:08:58,730 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:58,730 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:58,730 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,031 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1333] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][63], [24#thr1EXITtrue, 110#L711-1true, 104#L725-4true, Black: 259#true, 229#L711true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:59,031 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,032 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,032 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,032 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1445] L710-1-->L711: Formula: (= 0 |v_#race~seed~0_4|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_4|} AuxVars[] AssignedVars[#race~seed~0][23], [235#L711-1true, Black: 259#true, 104#L725-4true, 47#L711true, 109#thr1EXITtrue, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:59,073 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,073 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,073 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,073 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2022-12-13 11:08:59,707 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 109#thr1EXITtrue, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:59,707 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,707 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,707 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,707 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,724 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, Black: 261#(= |#race~seed~0| 0), 148#L725-5true, 109#thr1EXITtrue, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:08:59,725 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,725 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,725 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,725 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:08:59,725 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 11:09:00,032 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][107], [235#L711-1true, 104#L725-4true, Black: 261#(= |#race~seed~0| 0), 79#L714true, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:09:00,032 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,032 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,032 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,032 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,068 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1577] L713-1-->L713-3: Formula: (= |v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_176|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_176|, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][132], [114#L713-3true, 104#L725-4true, Black: 261#(= |#race~seed~0| 0), 56#L711-1true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 150#L714true, 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:09:00,068 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,068 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,068 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,068 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, 104#L725-4true, 79#L714true, Black: 261#(= |#race~seed~0| 0), 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:09:00,725 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,725 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,725 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,725 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,738 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, 104#L725-4true, 79#L714true, Black: 261#(= |#race~seed~0| 0), 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:09:00,738 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,738 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,738 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,738 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,738 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2022-12-13 11:09:00,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][107], [235#L711-1true, 104#L725-4true, Black: 261#(= |#race~seed~0| 0), 109#thr1EXITtrue, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:09:00,744 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2022-12-13 11:09:00,744 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:00,744 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:00,744 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:00,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1577] L713-1-->L713-3: Formula: (= |v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_176|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_176|, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread3of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][132], [114#L713-3true, 104#L725-4true, Black: 261#(= |#race~seed~0| 0), 56#L711-1true, Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 271#true, 101#L713-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 89#thr1EXITtrue, 256#true]) [2022-12-13 11:09:00,768 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2022-12-13 11:09:00,769 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:00,769 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:00,769 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,234 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, 104#L725-4true, Black: 261#(= |#race~seed~0| 0), 109#thr1EXITtrue, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:09:01,234 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,234 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,234 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,234 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,248 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1560] L713-1-->L713-3: Formula: (= |v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21| |v_#race~seed~0_172|) InVars {} OutVars{#race~seed~0=|v_#race~seed~0_172|, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1=|v_thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1_21|} AuxVars[] AssignedVars[#race~seed~0, thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1][38], [235#L711-1true, 104#L725-4true, Black: 261#(= |#race~seed~0| 0), 109#thr1EXITtrue, 273#(= |#race~seed~0| |thr1Thread2of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), Black: 267#(= |#race~seed~0| |thr1Thread1of4ForFork0_PseudoRandomUsingAtomic_nextInt_#t~nondet7#1|), 265#true, 85#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 64#L713-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 256#true]) [2022-12-13 11:09:01,249 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,249 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,249 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,249 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:01,249 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 11:09:02,026 INFO L130 PetriNetUnfolder]: 282324/398066 cut-off events. [2022-12-13 11:09:02,026 INFO L131 PetriNetUnfolder]: For 318452/330535 co-relation queries the response was YES. [2022-12-13 11:09:03,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053219 conditions, 398066 events. 282324/398066 cut-off events. For 318452/330535 co-relation queries the response was YES. Maximal size of possible extension queue 13118. Compared 3370496 event pairs, 158817 based on Foata normal form. 3440/334861 useless extension candidates. Maximal degree in co-relation 1053209. Up to 329847 conditions per place. [2022-12-13 11:09:04,983 INFO L137 encePairwiseOnDemand]: 457/469 looper letters, 92 selfloop transitions, 35 changer transitions 0/162 dead transitions. [2022-12-13 11:09:04,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 162 transitions, 1016 flow [2022-12-13 11:09:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:09:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:09:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2022-12-13 11:09:04,986 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2022-12-13 11:09:04,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2022-12-13 11:09:04,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2022-12-13 11:09:04,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:09:04,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2022-12-13 11:09:04,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:04,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:04,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:04,989 INFO L175 Difference]: Start difference. First operand has 81 places, 109 transitions, 500 flow. Second operand 3 states and 669 transitions. [2022-12-13 11:09:04,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 162 transitions, 1016 flow [2022-12-13 11:09:24,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 162 transitions, 942 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:09:24,990 INFO L231 Difference]: Finished difference. Result has 82 places, 140 transitions, 799 flow [2022-12-13 11:09:24,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=82, PETRI_TRANSITIONS=140} [2022-12-13 11:09:24,991 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2022-12-13 11:09:24,991 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 140 transitions, 799 flow [2022-12-13 11:09:24,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:09:24,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:09:24,991 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:09:24,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:09:24,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2022-12-13 11:09:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:09:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash 579569304, now seen corresponding path program 1 times [2022-12-13 11:09:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:09:24,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145981592] [2022-12-13 11:09:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:09:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:09:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:09:25,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:09:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:09:25,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:09:25,009 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:09:25,009 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2022-12-13 11:09:25,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2022-12-13 11:09:25,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2022-12-13 11:09:25,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2022-12-13 11:09:25,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2022-12-13 11:09:25,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2022-12-13 11:09:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2022-12-13 11:09:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2022-12-13 11:09:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2022-12-13 11:09:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2022-12-13 11:09:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2022-12-13 11:09:25,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:09:25,013 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-13 11:09:25,018 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2022-12-13 11:09:25,018 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:09:25,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:09:25 BasicIcfg [2022-12-13 11:09:25,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:09:25,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:09:25,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:09:25,053 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:09:25,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:07:23" (3/4) ... [2022-12-13 11:09:25,055 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 11:09:25,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:09:25,055 INFO L158 Benchmark]: Toolchain (without parser) took 122539.28ms. Allocated memory was 136.3MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 103.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. [2022-12-13 11:09:25,056 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory was 106.5MB in the beginning and 106.4MB in the end (delta: 169.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:09:25,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.65ms. Allocated memory is still 136.3MB. Free memory was 103.2MB in the beginning and 83.8MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 11:09:25,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.94ms. Allocated memory is still 136.3MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:09:25,056 INFO L158 Benchmark]: Boogie Preprocessor took 19.78ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 80.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:09:25,056 INFO L158 Benchmark]: RCFGBuilder took 352.60ms. Allocated memory is still 136.3MB. Free memory was 80.1MB in the beginning and 62.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 11:09:25,057 INFO L158 Benchmark]: TraceAbstraction took 121805.11ms. Allocated memory was 136.3MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 62.0MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. [2022-12-13 11:09:25,057 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 9.7GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:09:25,058 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.19ms. Allocated memory is still 136.3MB. Free memory was 106.5MB in the beginning and 106.4MB in the end (delta: 169.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.65ms. Allocated memory is still 136.3MB. Free memory was 103.2MB in the beginning and 83.8MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.94ms. Allocated memory is still 136.3MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.78ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 80.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 352.60ms. Allocated memory is still 136.3MB. Free memory was 80.1MB in the beginning and 62.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 121805.11ms. Allocated memory was 136.3MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 62.0MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 9.7GB. Free memory is still 1.5GB. 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: 1.5s, 85 PlacesBefore, 18 PlacesAfterwards, 86 TransitionsBefore, 16 TransitionsAfterwards, 1568 CoEnabledTransitionPairs, 6 FixpointIterations, 14 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 1366 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1366, independent: 1366, independent conditional: 0, independent unconditional: 1366, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 788, independent: 788, independent conditional: 0, independent unconditional: 788, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1366, independent: 578, independent conditional: 0, independent unconditional: 578, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 788, unknown conditional: 0, unknown unconditional: 788] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 141 PlacesBefore, 49 PlacesAfterwards, 143 TransitionsBefore, 47 TransitionsAfterwards, 9520 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 18016 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9175, independent: 8880, independent conditional: 0, independent unconditional: 8880, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5117, independent: 5021, independent conditional: 0, independent unconditional: 5021, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9175, independent: 3859, independent conditional: 0, independent unconditional: 3859, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 5117, unknown conditional: 0, unknown unconditional: 5117] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 197 PlacesBefore, 70 PlacesAfterwards, 200 TransitionsBefore, 67 TransitionsAfterwards, 23856 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 130 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 6 ChoiceCompositions, 170 TotalNumberOfCompositions, 48261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23053, independent: 22604, independent conditional: 0, independent unconditional: 22604, dependent: 449, dependent conditional: 0, dependent unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12605, independent: 12459, independent conditional: 0, independent unconditional: 12459, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23053, independent: 10145, independent conditional: 0, independent unconditional: 10145, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 12605, unknown conditional: 0, unknown unconditional: 12605] , Statistics on independence cache: Total cache size (in pairs): 589, Positive cache size: 540, Positive conditional cache size: 0, Positive unconditional cache size: 540, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 253 PlacesBefore, 91 PlacesAfterwards, 257 TransitionsBefore, 89 TransitionsAfterwards, 44576 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 163 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 6 ChoiceCompositions, 212 TotalNumberOfCompositions, 88261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37652, independent: 37095, independent conditional: 0, independent unconditional: 37095, dependent: 557, dependent conditional: 0, dependent unconditional: 557, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23226, independent: 23035, independent conditional: 0, independent unconditional: 23035, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37652, independent: 14060, independent conditional: 0, independent unconditional: 14060, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 23226, unknown conditional: 0, unknown unconditional: 23226] , Statistics on independence cache: Total cache size (in pairs): 890, Positive cache size: 821, Positive conditional cache size: 0, Positive unconditional cache size: 821, Negative cache size: 69, Negative conditional cache size: 0, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 709]: Data race detected Data race detected The following path leads to a data race: [L689] 0 int m = 0; [L706] 0 int seed = 1; [L724] 0 pthread_t t; VAL [m=0, seed=1, t={3:0}] [L725] COND TRUE 0 1 [L725] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m=0, pthread_create(&t, 0, thr1, 0)=-1, seed=1, t={3:0}] [L725] COND TRUE 0 1 [L719] CALL 1 PseudoRandomUsingAtomic_nextInt() [L708] 1 int read, nexts, nextInt_return; [L709] EXPR 1 seed != 0 VAL [m=0, seed=1] [L709] COND FALSE 1 !(!(seed != 0)) VAL [m=0, seed=1] [L725] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m=0, pthread_create(&t, 0, thr1, 0)=0, seed=1, t={3:0}] [L710] CALL 1 __VERIFIER_atomic_acquire() [L692] EXPR 1 m==0 [L692] CALL 1 assume_abort_if_not(m==0) [L3] COND FALSE 1 !(!cond) [L692] RET 1 assume_abort_if_not(m==0) [L693] 1 m = 1 [L710] RET 1 __VERIFIER_atomic_acquire() [L711] 1 read = seed VAL [m=1, seed=1] [L719] CALL 2 PseudoRandomUsingAtomic_nextInt() [L708] 2 int read, nexts, nextInt_return; [L709] 2 seed != 0 VAL [m=1, seed=1] [L711] 1 read = seed [L712] CALL, EXPR 1 calculateNext(read) [L701] 1 int cnex; VAL [\old(s2)=1, m=1, s2=1, seed=1] [L702] 1 cnex = __VERIFIER_nondet_int() [L703] COND FALSE 1 !(cnex == s2 || cnex == 0) [L704] 1 return cnex; [L712] RET, EXPR 1 calculateNext(read) [L712] 1 nexts = calculateNext(read) [L713] 1 seed = nexts VAL [m=1, nexts=-2, read=1, seed=-2, seed = nexts=49] [L709] 2 seed != 0 VAL [m=1, nexts=-2, read=1, seed=-2, seed = nexts=49] Now there is a data race on ~seed~0 between C: seed = nexts [713] and C: seed != 0 [709] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: 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: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: 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: 725]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 137 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 191 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 8 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 245 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.2s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 31 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 299 locations, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 112.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 110.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 521 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 79 mSDtfsCounter, 521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:09:25,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_610141e6-02fc-4a5c-909b-de8e104d35fe/bin/uautomizer-uyxdKDjOR8/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