./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-array-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/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_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-array-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/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_8ee711cf-f93b-4d62-9675-e4ff7afec444/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 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 --- 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 21:28:23,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:28:23,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:28:23,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:28:23,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:28:23,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:28:23,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:28:23,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:28:23,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:28:23,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:28:23,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:28:23,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:28:23,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:28:23,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:28:23,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:28:23,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:28:23,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:28:23,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:28:23,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:28:23,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:28:23,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:28:23,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:28:23,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:28:23,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:28:23,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:28:23,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:28:23,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:28:23,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:28:23,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:28:23,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:28:23,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:28:23,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:28:23,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:28:23,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:28:23,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:28:23,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:28:23,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:28:23,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:28:23,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:28:23,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:28:23,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:28:23,148 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-12-13 21:28:23,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:28:23,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:28:23,162 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:28:23,162 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:28:23,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:28:23,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:28:23,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:28:23,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:28:23,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:28:23,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:28:23,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:28:23,165 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 21:28:23,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:28:23,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:28:23,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:28:23,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:28:23,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:28:23,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:28:23,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:28:23,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:28:23,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:28:23,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:28:23,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:28:23,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:28:23,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:28:23,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:28:23,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:28:23,167 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:28:23,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:28:23,167 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:28:23,167 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_8ee711cf-f93b-4d62-9675-e4ff7afec444/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_8ee711cf-f93b-4d62-9675-e4ff7afec444/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 -> 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 [2022-12-13 21:28:23,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:28:23,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:28:23,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:28:23,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:28:23,354 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:28:23,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2022-12-13 21:28:25,866 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:28:26,072 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:28:26,073 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2022-12-13 21:28:26,084 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/data/0797b58df/d9301e77bfb249bd9d1e9623c953667b/FLAGcb51c6bed [2022-12-13 21:28:26,437 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/data/0797b58df/d9301e77bfb249bd9d1e9623c953667b [2022-12-13 21:28:26,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:28:26,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:28:26,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:28:26,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:28:26,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:28:26,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366be851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26, skipping insertion in model container [2022-12-13 21:28:26,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:28:26,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:28:26,691 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_8ee711cf-f93b-4d62-9675-e4ff7afec444/sv-benchmarks/c/pthread-nondet/nondet-array-2.i[30035,30048] [2022-12-13 21:28:26,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:28:26,712 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:28:26,733 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_8ee711cf-f93b-4d62-9675-e4ff7afec444/sv-benchmarks/c/pthread-nondet/nondet-array-2.i[30035,30048] [2022-12-13 21:28:26,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:28:26,758 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:28:26,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26 WrapperNode [2022-12-13 21:28:26,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:28:26,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:28:26,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:28:26,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:28:26,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,789 INFO L138 Inliner]: procedures = 170, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2022-12-13 21:28:26,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:28:26,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:28:26,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:28:26,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:28:26,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,808 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:28:26,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:28:26,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:28:26,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:28:26,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 21:28:26,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:28:26,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:28:26,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:28:26,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee711cf-f93b-4d62-9675-e4ff7afec444/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:28:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-13 21:28:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:28:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:28:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-12-13 21:28:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-12-13 21:28:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:28:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:28:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:28:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:28:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:28:26,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:28:26,866 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 21:28:26,969 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:28:26,971 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:28:27,191 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:28:27,199 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:28:27,199 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 21:28:27,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:28:27 BoogieIcfgContainer [2022-12-13 21:28:27,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:28:27,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:28:27,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:28:27,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:28:27,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:28:26" (1/3) ... [2022-12-13 21:28:27,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582aff15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:28:27, skipping insertion in model container [2022-12-13 21:28:27,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (2/3) ... [2022-12-13 21:28:27,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582aff15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:28:27, skipping insertion in model container [2022-12-13 21:28:27,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:28:27" (3/3) ... [2022-12-13 21:28:27,210 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-array-2.i [2022-12-13 21:28:27,218 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:28:27,226 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:28:27,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-12-13 21:28:27,226 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:28:27,284 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 21:28:27,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 115 transitions, 238 flow [2022-12-13 21:28:27,375 INFO L130 PetriNetUnfolder]: 12/164 cut-off events. [2022-12-13 21:28:27,376 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-12-13 21:28:27,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 164 events. 12/164 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 421 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2022-12-13 21:28:27,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 115 transitions, 238 flow [2022-12-13 21:28:27,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 115 transitions, 238 flow [2022-12-13 21:28:27,389 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:28:27,400 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 115 transitions, 238 flow [2022-12-13 21:28:27,403 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 115 transitions, 238 flow [2022-12-13 21:28:27,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 115 transitions, 238 flow [2022-12-13 21:28:27,432 INFO L130 PetriNetUnfolder]: 12/164 cut-off events. [2022-12-13 21:28:27,433 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-12-13 21:28:27,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 164 events. 12/164 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 421 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2022-12-13 21:28:27,434 INFO L119 LiptonReduction]: Number of co-enabled transitions 2310 [2022-12-13 21:28:29,210 INFO L134 LiptonReduction]: Checked pairs total: 6316 [2022-12-13 21:28:29,210 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 21:28:29,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:28:29,224 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;@59cde35b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:28:29,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-13 21:28:29,227 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 21:28:29,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:28:29,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:29,227 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 21:28:29,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 21:28:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash 12819396, now seen corresponding path program 1 times [2022-12-13 21:28:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:29,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082726319] [2022-12-13 21:28:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:29,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:29,373 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 21:28:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:29,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082726319] [2022-12-13 21:28:29,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082726319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:29,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:29,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:28:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922359792] [2022-12-13 21:28:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:29,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:28:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:28:29,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:28:29,405 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 213 [2022-12-13 21:28:29,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 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 21:28:29,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:28:29,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 213 [2022-12-13 21:28:29,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:28:29,451 INFO L130 PetriNetUnfolder]: 27/134 cut-off events. [2022-12-13 21:28:29,451 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 21:28:29,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 134 events. 27/134 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 655 event pairs, 21 based on Foata normal form. 8/123 useless extension candidates. Maximal degree in co-relation 166. Up to 68 conditions per place. [2022-12-13 21:28:29,453 INFO L137 encePairwiseOnDemand]: 211/213 looper letters, 15 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-12-13 21:28:29,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 100 flow [2022-12-13 21:28:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:28:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 21:28:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 231 transitions. [2022-12-13 21:28:29,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5422535211267606 [2022-12-13 21:28:29,463 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 231 transitions. [2022-12-13 21:28:29,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 231 transitions. [2022-12-13 21:28:29,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:28:29,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 231 transitions. [2022-12-13 21:28:29,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 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 21:28:29,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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 21:28:29,472 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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 21:28:29,473 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 74 flow. Second operand 2 states and 231 transitions. [2022-12-13 21:28:29,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 100 flow [2022-12-13 21:28:29,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:28:29,477 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 70 flow [2022-12-13 21:28:29,478 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2022-12-13 21:28:29,481 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2022-12-13 21:28:29,481 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 70 flow [2022-12-13 21:28:29,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 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 21:28:29,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:29,482 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-12-13 21:28:29,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:28:29,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 21:28:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash -565423605, now seen corresponding path program 1 times [2022-12-13 21:28:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:29,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865915890] [2022-12-13 21:28:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:28:29,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:28:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:28:29,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:28:29,537 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:28:29,538 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2022-12-13 21:28:29,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-12-13 21:28:29,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-12-13 21:28:29,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-12-13 21:28:29,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2022-12-13 21:28:29,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-12-13 21:28:29,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-12-13 21:28:29,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-12-13 21:28:29,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-12-13 21:28:29,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:28:29,541 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 21:28:29,543 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 21:28:29,544 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-13 21:28:29,561 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 21:28:29,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 138 transitions, 294 flow [2022-12-13 21:28:29,589 INFO L130 PetriNetUnfolder]: 23/293 cut-off events. [2022-12-13 21:28:29,589 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-13 21:28:29,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 293 events. 23/293 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 907 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 166. Up to 8 conditions per place. [2022-12-13 21:28:29,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 138 transitions, 294 flow [2022-12-13 21:28:29,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 138 transitions, 294 flow [2022-12-13 21:28:29,592 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:28:29,592 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 138 transitions, 294 flow [2022-12-13 21:28:29,592 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 138 transitions, 294 flow [2022-12-13 21:28:29,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 138 transitions, 294 flow [2022-12-13 21:28:29,614 INFO L130 PetriNetUnfolder]: 23/293 cut-off events. [2022-12-13 21:28:29,614 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-13 21:28:29,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 293 events. 23/293 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 907 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 166. Up to 8 conditions per place. [2022-12-13 21:28:29,617 INFO L119 LiptonReduction]: Number of co-enabled transitions 5964 [2022-12-13 21:28:31,558 INFO L134 LiptonReduction]: Checked pairs total: 31108 [2022-12-13 21:28:31,558 INFO L136 LiptonReduction]: Total number of compositions: 91 [2022-12-13 21:28:31,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:28:31,560 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;@59cde35b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:28:31,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-12-13 21:28:31,562 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 21:28:31,562 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:28:31,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:31,562 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:28:31,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-12-13 21:28:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash 637860927, now seen corresponding path program 1 times [2022-12-13 21:28:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:31,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119760548] [2022-12-13 21:28:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:31,601 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 21:28:31,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:31,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119760548] [2022-12-13 21:28:31,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119760548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:31,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:31,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:28:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820175545] [2022-12-13 21:28:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:31,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:28:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:31,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:28:31,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:28:31,619 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 229 [2022-12-13 21:28:31,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 21:28:31,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:28:31,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 229 [2022-12-13 21:28:31,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:28:31,946 INFO L130 PetriNetUnfolder]: 1239/2991 cut-off events. [2022-12-13 21:28:31,946 INFO L131 PetriNetUnfolder]: For 126/155 co-relation queries the response was YES. [2022-12-13 21:28:31,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 2991 events. 1239/2991 cut-off events. For 126/155 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 21429 event pairs, 337 based on Foata normal form. 0/2506 useless extension candidates. Maximal degree in co-relation 4129. Up to 1173 conditions per place. [2022-12-13 21:28:31,960 INFO L137 encePairwiseOnDemand]: 221/229 looper letters, 48 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2022-12-13 21:28:31,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 303 flow [2022-12-13 21:28:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:28:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:28:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-12-13 21:28:31,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6055312954876274 [2022-12-13 21:28:31,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2022-12-13 21:28:31,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2022-12-13 21:28:31,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:28:31,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2022-12-13 21:28:31,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 21:28:31,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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 21:28:31,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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 21:28:31,968 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 134 flow. Second operand 3 states and 416 transitions. [2022-12-13 21:28:31,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 303 flow [2022-12-13 21:28:31,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 303 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:28:31,971 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 186 flow [2022-12-13 21:28:31,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2022-12-13 21:28:31,971 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2022-12-13 21:28:31,971 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 186 flow [2022-12-13 21:28:31,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 21:28:31,972 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:31,972 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:28:31,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-12-13 21:28:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1636485366, now seen corresponding path program 1 times [2022-12-13 21:28:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:31,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248588228] [2022-12-13 21:28:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:32,052 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 21:28:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248588228] [2022-12-13 21:28:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248588228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:32,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:32,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:28:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174094724] [2022-12-13 21:28:32,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:32,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:28:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:32,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:28:32,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:28:32,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 229 [2022-12-13 21:28:32,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 21:28:32,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:28:32,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 229 [2022-12-13 21:28:32,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:28:32,378 INFO L130 PetriNetUnfolder]: 851/2485 cut-off events. [2022-12-13 21:28:32,379 INFO L131 PetriNetUnfolder]: For 527/547 co-relation queries the response was YES. [2022-12-13 21:28:32,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 2485 events. 851/2485 cut-off events. For 527/547 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 19137 event pairs, 275 based on Foata normal form. 0/2123 useless extension candidates. Maximal degree in co-relation 1389. Up to 634 conditions per place. [2022-12-13 21:28:32,391 INFO L137 encePairwiseOnDemand]: 220/229 looper letters, 56 selfloop transitions, 8 changer transitions 2/103 dead transitions. [2022-12-13 21:28:32,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 438 flow [2022-12-13 21:28:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:28:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:28:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2022-12-13 21:28:32,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5578602620087336 [2022-12-13 21:28:32,394 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2022-12-13 21:28:32,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2022-12-13 21:28:32,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:28:32,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2022-12-13 21:28:32,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 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 21:28:32,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 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 21:28:32,398 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 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 21:28:32,398 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 186 flow. Second operand 4 states and 511 transitions. [2022-12-13 21:28:32,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 438 flow [2022-12-13 21:28:32,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:28:32,401 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 222 flow [2022-12-13 21:28:32,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2022-12-13 21:28:32,402 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2022-12-13 21:28:32,402 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 222 flow [2022-12-13 21:28:32,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 21:28:32,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:32,402 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-12-13 21:28:32,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:28:32,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-12-13 21:28:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash -609889482, now seen corresponding path program 1 times [2022-12-13 21:28:32,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:32,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154941480] [2022-12-13 21:28:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:32,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:28:32,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:28:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:28:32,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:28:32,429 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:28:32,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2022-12-13 21:28:32,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2022-12-13 21:28:32,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2022-12-13 21:28:32,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2022-12-13 21:28:32,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2022-12-13 21:28:32,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2022-12-13 21:28:32,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2022-12-13 21:28:32,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2022-12-13 21:28:32,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2022-12-13 21:28:32,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2022-12-13 21:28:32,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2022-12-13 21:28:32,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2022-12-13 21:28:32,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:28:32,431 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 21:28:32,432 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 21:28:32,432 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-12-13 21:28:32,448 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 21:28:32,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 352 flow [2022-12-13 21:28:32,489 INFO L130 PetriNetUnfolder]: 45/519 cut-off events. [2022-12-13 21:28:32,489 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-13 21:28:32,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 519 events. 45/519 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1953 event pairs, 1 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 301. Up to 16 conditions per place. [2022-12-13 21:28:32,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 352 flow [2022-12-13 21:28:32,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 352 flow [2022-12-13 21:28:32,492 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:28:32,492 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 161 transitions, 352 flow [2022-12-13 21:28:32,492 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 161 transitions, 352 flow [2022-12-13 21:28:32,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 352 flow [2022-12-13 21:28:32,541 INFO L130 PetriNetUnfolder]: 45/519 cut-off events. [2022-12-13 21:28:32,541 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-13 21:28:32,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 519 events. 45/519 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1953 event pairs, 1 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 301. Up to 16 conditions per place. [2022-12-13 21:28:32,554 INFO L119 LiptonReduction]: Number of co-enabled transitions 10458 [2022-12-13 21:28:34,040 INFO L134 LiptonReduction]: Checked pairs total: 54178 [2022-12-13 21:28:34,041 INFO L136 LiptonReduction]: Total number of compositions: 99 [2022-12-13 21:28:34,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:28:34,042 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;@59cde35b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:28:34,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-12-13 21:28:34,044 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 21:28:34,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:28:34,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:34,044 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:28:34,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2022-12-13 21:28:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 907919394, now seen corresponding path program 1 times [2022-12-13 21:28:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:34,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386848754] [2022-12-13 21:28:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:34,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:34,064 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 21:28:34,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:34,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386848754] [2022-12-13 21:28:34,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386848754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:34,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:34,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:28:34,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914681455] [2022-12-13 21:28:34,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:34,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:28:34,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:28:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:28:34,081 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 260 [2022-12-13 21:28:34,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 21:28:34,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:28:34,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 260 [2022-12-13 21:28:34,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:28:36,660 INFO L130 PetriNetUnfolder]: 19347/37426 cut-off events. [2022-12-13 21:28:36,661 INFO L131 PetriNetUnfolder]: For 1545/1623 co-relation queries the response was YES. [2022-12-13 21:28:36,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66168 conditions, 37426 events. 19347/37426 cut-off events. For 1545/1623 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 358078 event pairs, 7149 based on Foata normal form. 0/32216 useless extension candidates. Maximal degree in co-relation 33199. Up to 15316 conditions per place. [2022-12-13 21:28:36,894 INFO L137 encePairwiseOnDemand]: 248/260 looper letters, 62 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2022-12-13 21:28:36,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 409 flow [2022-12-13 21:28:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:28:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:28:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-12-13 21:28:36,897 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2022-12-13 21:28:36,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2022-12-13 21:28:36,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2022-12-13 21:28:36,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:28:36,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2022-12-13 21:28:36,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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 21:28:36,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 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 21:28:36,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 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 21:28:36,905 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 180 flow. Second operand 3 states and 485 transitions. [2022-12-13 21:28:36,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 409 flow [2022-12-13 21:28:36,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:28:36,909 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 258 flow [2022-12-13 21:28:36,910 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2022-12-13 21:28:36,911 INFO L288 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2022-12-13 21:28:36,911 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 258 flow [2022-12-13 21:28:36,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 21:28:36,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:36,912 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:36,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:28:36,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2022-12-13 21:28:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 734569117, now seen corresponding path program 1 times [2022-12-13 21:28:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:36,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682609081] [2022-12-13 21:28:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:36,981 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 21:28:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682609081] [2022-12-13 21:28:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682609081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:36,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:36,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:28:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896541563] [2022-12-13 21:28:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:36,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:28:36,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:36,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:28:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:28:37,033 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 260 [2022-12-13 21:28:37,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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 21:28:37,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:28:37,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 260 [2022-12-13 21:28:37,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:28:39,574 INFO L130 PetriNetUnfolder]: 14536/33413 cut-off events. [2022-12-13 21:28:39,574 INFO L131 PetriNetUnfolder]: For 10536/10727 co-relation queries the response was YES. [2022-12-13 21:28:39,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64211 conditions, 33413 events. 14536/33413 cut-off events. For 10536/10727 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 364061 event pairs, 4763 based on Foata normal form. 0/28703 useless extension candidates. Maximal degree in co-relation 7197. Up to 9779 conditions per place. [2022-12-13 21:28:39,736 INFO L137 encePairwiseOnDemand]: 251/260 looper letters, 80 selfloop transitions, 8 changer transitions 2/138 dead transitions. [2022-12-13 21:28:39,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 138 transitions, 615 flow [2022-12-13 21:28:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:28:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:28:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 613 transitions. [2022-12-13 21:28:39,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5894230769230769 [2022-12-13 21:28:39,738 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 613 transitions. [2022-12-13 21:28:39,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 613 transitions. [2022-12-13 21:28:39,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:28:39,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 613 transitions. [2022-12-13 21:28:39,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 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 21:28:39,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 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 21:28:39,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 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 21:28:39,743 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 258 flow. Second operand 4 states and 613 transitions. [2022-12-13 21:28:39,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 138 transitions, 615 flow [2022-12-13 21:28:39,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 138 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:28:39,768 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 288 flow [2022-12-13 21:28:39,769 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2022-12-13 21:28:39,769 INFO L288 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2022-12-13 21:28:39,769 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 288 flow [2022-12-13 21:28:39,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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 21:28:39,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:39,770 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:39,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:28:39,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2022-12-13 21:28:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash 703353575, now seen corresponding path program 1 times [2022-12-13 21:28:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:39,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125209567] [2022-12-13 21:28:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 21:28:40,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:40,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125209567] [2022-12-13 21:28:40,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125209567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:40,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:40,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:28:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597494370] [2022-12-13 21:28:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:40,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:28:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:40,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:28:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:28:40,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 260 [2022-12-13 21:28:40,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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 21:28:40,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:28:40,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 260 [2022-12-13 21:28:40,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:28:53,095 INFO L130 PetriNetUnfolder]: 98603/166475 cut-off events. [2022-12-13 21:28:53,095 INFO L131 PetriNetUnfolder]: For 40642/40643 co-relation queries the response was YES. [2022-12-13 21:28:53,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356928 conditions, 166475 events. 98603/166475 cut-off events. For 40642/40643 co-relation queries the response was YES. Maximal size of possible extension queue 3548. Compared 1594484 event pairs, 50927 based on Foata normal form. 0/160208 useless extension candidates. Maximal degree in co-relation 77237. Up to 111908 conditions per place. [2022-12-13 21:28:53,897 INFO L137 encePairwiseOnDemand]: 241/260 looper letters, 131 selfloop transitions, 55 changer transitions 0/218 dead transitions. [2022-12-13 21:28:53,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 218 transitions, 1012 flow [2022-12-13 21:28:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:28:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:28:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2022-12-13 21:28:53,902 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5653846153846154 [2022-12-13 21:28:53,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 882 transitions. [2022-12-13 21:28:53,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 882 transitions. [2022-12-13 21:28:53,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:28:53,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 882 transitions. [2022-12-13 21:28:53,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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 21:28:53,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 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 21:28:53,913 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 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 21:28:53,913 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 288 flow. Second operand 6 states and 882 transitions. [2022-12-13 21:28:53,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 218 transitions, 1012 flow [2022-12-13 21:28:53,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 218 transitions, 1010 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 21:28:53,967 INFO L231 Difference]: Finished difference. Result has 95 places, 143 transitions, 657 flow [2022-12-13 21:28:53,968 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=657, PETRI_PLACES=95, PETRI_TRANSITIONS=143} [2022-12-13 21:28:53,968 INFO L288 CegarLoopForPetriNet]: 78 programPoint places, 17 predicate places. [2022-12-13 21:28:53,968 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 143 transitions, 657 flow [2022-12-13 21:28:53,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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 21:28:53,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:28:53,969 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:53,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:28:53,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2022-12-13 21:28:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:53,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1177638188, now seen corresponding path program 1 times [2022-12-13 21:28:53,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:53,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809356741] [2022-12-13 21:28:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:54,179 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 21:28:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:54,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809356741] [2022-12-13 21:28:54,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809356741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:54,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:54,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:28:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815136606] [2022-12-13 21:28:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:54,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:28:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:28:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:28:54,321 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 260 [2022-12-13 21:28:54,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 143 transitions, 657 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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 21:28:54,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:28:54,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 260 [2022-12-13 21:28:54,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:02,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([852] L694-1-->L694-3: Formula: (= (store |v_#race_66| |v_~#a~0.base_96| (store (select |v_#race_66| |v_~#a~0.base_96|) (+ |v_~#a~0.offset_95| (* v_thrThread2of3ForFork0_~t~0_23 4)) |v_thrThread2of3ForFork0_#t~nondet3_23|)) |v_#race_65|) InVars {#race=|v_#race_66|, thrThread2of3ForFork0_~t~0=v_thrThread2of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_96|, ~#a~0.offset=|v_~#a~0.offset_95|} OutVars{#race=|v_#race_65|, thrThread2of3ForFork0_~t~0=v_thrThread2of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_96|, ~#a~0.offset=|v_~#a~0.offset_95|, thrThread2of3ForFork0_#t~nondet3=|v_thrThread2of3ForFork0_#t~nondet3_23|} AuxVars[] AssignedVars[#race, thrThread2of3ForFork0_#t~nondet3][121], [thrThread3of3ForFork0InUse, 170#(= |ULTIMATE.start_main_~i~0#1| 0), 99#L693-1true, Black: 162#true, 6#L706-6true, 187#true, 43#L694-3true, Black: 171#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 177#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 179#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 138#thrEXITtrue, 175#true, Black: 180#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 178#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse]) [2022-12-13 21:29:02,349 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 21:29:02,349 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 21:29:02,349 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 21:29:02,349 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 21:29:07,516 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([846] L694-1-->L694-3: Formula: (= (store |v_#race_62| |v_~#a~0.base_94| (store (select |v_#race_62| |v_~#a~0.base_94|) (+ |v_~#a~0.offset_93| (* v_thrThread3of3ForFork0_~t~0_23 4)) |v_thrThread3of3ForFork0_#t~nondet3_19|)) |v_#race_61|) InVars {#race=|v_#race_62|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|} OutVars{#race=|v_#race_61|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_19|} AuxVars[] AssignedVars[#race, thrThread3of3ForFork0_#t~nondet3][299], [thrThread3of3ForFork0InUse, 170#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 162#true, 6#L706-6true, 187#true, Black: 171#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 65#L694-3true, 5#L694-7true, 4#thrEXITtrue, Black: 177#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 179#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 175#true, Black: 180#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 178#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse]) [2022-12-13 21:29:07,516 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 21:29:07,516 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:29:07,516 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:29:07,517 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:29:09,493 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([846] L694-1-->L694-3: Formula: (= (store |v_#race_62| |v_~#a~0.base_94| (store (select |v_#race_62| |v_~#a~0.base_94|) (+ |v_~#a~0.offset_93| (* v_thrThread3of3ForFork0_~t~0_23 4)) |v_thrThread3of3ForFork0_#t~nondet3_19|)) |v_#race_61|) InVars {#race=|v_#race_62|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|} OutVars{#race=|v_#race_61|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_19|} AuxVars[] AssignedVars[#race, thrThread3of3ForFork0_#t~nondet3][218], [thrThread3of3ForFork0InUse, 170#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L695-1true, Black: 162#true, 6#L706-6true, 187#true, Black: 171#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 65#L694-3true, 4#thrEXITtrue, Black: 177#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 179#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 175#true, Black: 180#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 178#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse]) [2022-12-13 21:29:09,493 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2022-12-13 21:29:09,494 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:29:09,494 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:29:09,494 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:29:10,018 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([846] L694-1-->L694-3: Formula: (= (store |v_#race_62| |v_~#a~0.base_94| (store (select |v_#race_62| |v_~#a~0.base_94|) (+ |v_~#a~0.offset_93| (* v_thrThread3of3ForFork0_~t~0_23 4)) |v_thrThread3of3ForFork0_#t~nondet3_19|)) |v_#race_61|) InVars {#race=|v_#race_62|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|} OutVars{#race=|v_#race_61|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_19|} AuxVars[] AssignedVars[#race, thrThread3of3ForFork0_#t~nondet3][218], [thrThread3of3ForFork0InUse, 170#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 162#true, 6#L706-6true, 187#true, Black: 171#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 65#L694-3true, 4#thrEXITtrue, Black: 177#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), 78#thrErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 175#true, Black: 180#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 178#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse]) [2022-12-13 21:29:10,018 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 21:29:10,018 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:29:10,018 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:29:10,018 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:29:10,938 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([846] L694-1-->L694-3: Formula: (= (store |v_#race_62| |v_~#a~0.base_94| (store (select |v_#race_62| |v_~#a~0.base_94|) (+ |v_~#a~0.offset_93| (* v_thrThread3of3ForFork0_~t~0_23 4)) |v_thrThread3of3ForFork0_#t~nondet3_19|)) |v_#race_61|) InVars {#race=|v_#race_62|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|} OutVars{#race=|v_#race_61|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_23, ~#a~0.base=|v_~#a~0.base_94|, ~#a~0.offset=|v_~#a~0.offset_93|, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_19|} AuxVars[] AssignedVars[#race, thrThread3of3ForFork0_#t~nondet3][218], [thrThread3of3ForFork0InUse, 170#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 162#true, 29#L695-1true, 6#L706-6true, 187#true, Black: 171#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 65#L694-3true, 4#thrEXITtrue, Black: 177#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 179#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 175#true, Black: 180#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 178#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse]) [2022-12-13 21:29:10,938 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2022-12-13 21:29:10,938 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:29:10,938 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:29:10,938 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:29:10,938 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:29:19,860 INFO L130 PetriNetUnfolder]: 206717/336749 cut-off events. [2022-12-13 21:29:19,861 INFO L131 PetriNetUnfolder]: For 198495/203858 co-relation queries the response was YES. [2022-12-13 21:29:20,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887710 conditions, 336749 events. 206717/336749 cut-off events. For 198495/203858 co-relation queries the response was YES. Maximal size of possible extension queue 6712. Compared 3266696 event pairs, 74967 based on Foata normal form. 68/321548 useless extension candidates. Maximal degree in co-relation 661172. Up to 193531 conditions per place. [2022-12-13 21:29:21,827 INFO L137 encePairwiseOnDemand]: 237/260 looper letters, 273 selfloop transitions, 112 changer transitions 0/413 dead transitions. [2022-12-13 21:29:21,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 413 transitions, 2663 flow [2022-12-13 21:29:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:29:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:29:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 956 transitions. [2022-12-13 21:29:21,830 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6128205128205129 [2022-12-13 21:29:21,830 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 956 transitions. [2022-12-13 21:29:21,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 956 transitions. [2022-12-13 21:29:21,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:21,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 956 transitions. [2022-12-13 21:29:21,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 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 21:29:21,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 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 21:29:21,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 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 21:29:21,834 INFO L175 Difference]: Start difference. First operand has 95 places, 143 transitions, 657 flow. Second operand 6 states and 956 transitions. [2022-12-13 21:29:21,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 413 transitions, 2663 flow [2022-12-13 21:29:23,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 413 transitions, 2663 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:29:23,750 INFO L231 Difference]: Finished difference. Result has 104 places, 255 transitions, 1712 flow [2022-12-13 21:29:23,750 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1712, PETRI_PLACES=104, PETRI_TRANSITIONS=255} [2022-12-13 21:29:23,751 INFO L288 CegarLoopForPetriNet]: 78 programPoint places, 26 predicate places. [2022-12-13 21:29:23,751 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 255 transitions, 1712 flow [2022-12-13 21:29:23,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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 21:29:23,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:23,751 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-12-13 21:29:23,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:29:23,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2022-12-13 21:29:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -220404795, now seen corresponding path program 1 times [2022-12-13 21:29:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:23,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381320114] [2022-12-13 21:29:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:29:23,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:29:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:29:23,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:29:23,773 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:29:23,773 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2022-12-13 21:29:23,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-12-13 21:29:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-12-13 21:29:23,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:29:23,775 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-13 21:29:23,775 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 21:29:23,775 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-12-13 21:29:23,789 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 21:29:23,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 184 transitions, 412 flow [2022-12-13 21:29:23,872 INFO L130 PetriNetUnfolder]: 91/941 cut-off events. [2022-12-13 21:29:23,872 INFO L131 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2022-12-13 21:29:23,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 941 events. 91/941 cut-off events. For 48/52 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4370 event pairs, 6 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 539. Up to 32 conditions per place. [2022-12-13 21:29:23,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 184 transitions, 412 flow [2022-12-13 21:29:23,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 184 transitions, 412 flow [2022-12-13 21:29:23,878 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:29:23,878 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 184 transitions, 412 flow [2022-12-13 21:29:23,878 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 184 transitions, 412 flow [2022-12-13 21:29:23,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 184 transitions, 412 flow [2022-12-13 21:29:23,959 INFO L130 PetriNetUnfolder]: 91/941 cut-off events. [2022-12-13 21:29:23,959 INFO L131 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2022-12-13 21:29:23,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 941 events. 91/941 cut-off events. For 48/52 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4370 event pairs, 6 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 539. Up to 32 conditions per place. [2022-12-13 21:29:23,976 INFO L119 LiptonReduction]: Number of co-enabled transitions 15960 [2022-12-13 21:29:25,731 INFO L134 LiptonReduction]: Checked pairs total: 100191 [2022-12-13 21:29:25,731 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-12-13 21:29:25,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:29:25,732 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;@59cde35b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:29:25,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-12-13 21:29:25,734 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 21:29:25,734 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:29:25,734 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:25,734 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:29:25,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2022-12-13 21:29:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:25,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1208455842, now seen corresponding path program 1 times [2022-12-13 21:29:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:25,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360187706] [2022-12-13 21:29:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:25,749 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 21:29:25,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:25,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360187706] [2022-12-13 21:29:25,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360187706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:25,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:25,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:29:25,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710786880] [2022-12-13 21:29:25,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:25,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:29:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:29:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:29:25,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 292 [2022-12-13 21:29:25,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 21:29:25,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:25,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 292 [2022-12-13 21:29:25,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:29:56,678 INFO L130 PetriNetUnfolder]: 285323/474309 cut-off events. [2022-12-13 21:29:56,678 INFO L131 PetriNetUnfolder]: For 24321/25921 co-relation queries the response was YES. [2022-12-13 21:29:57,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865696 conditions, 474309 events. 285323/474309 cut-off events. For 24321/25921 co-relation queries the response was YES. Maximal size of possible extension queue 12853. Compared 5184082 event pairs, 110648 based on Foata normal form. 0/409841 useless extension candidates. Maximal degree in co-relation 330544. Up to 206333 conditions per place. [2022-12-13 21:29:59,347 INFO L137 encePairwiseOnDemand]: 276/292 looper letters, 78 selfloop transitions, 12 changer transitions 0/134 dead transitions. [2022-12-13 21:29:59,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 525 flow [2022-12-13 21:29:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:29:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:29:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2022-12-13 21:29:59,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.634703196347032 [2022-12-13 21:29:59,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2022-12-13 21:29:59,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2022-12-13 21:29:59,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:29:59,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2022-12-13 21:29:59,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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 21:29:59,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 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 21:29:59,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 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 21:29:59,351 INFO L175 Difference]: Start difference. First operand has 96 places, 92 transitions, 228 flow. Second operand 3 states and 556 transitions. [2022-12-13 21:29:59,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 525 flow [2022-12-13 21:29:59,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:29:59,360 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 332 flow [2022-12-13 21:29:59,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2022-12-13 21:29:59,361 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2022-12-13 21:29:59,361 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 332 flow [2022-12-13 21:29:59,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 21:29:59,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:29:59,362 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:29:59,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:29:59,362 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2022-12-13 21:29:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:29:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash 652898849, now seen corresponding path program 1 times [2022-12-13 21:29:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:29:59,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730759923] [2022-12-13 21:29:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:29:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:29:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:29:59,407 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 21:29:59,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:29:59,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730759923] [2022-12-13 21:29:59,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730759923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:29:59,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:29:59,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:29:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519728888] [2022-12-13 21:29:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:29:59,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:29:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:29:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:29:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:29:59,460 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 292 [2022-12-13 21:29:59,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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 21:29:59,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:29:59,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 292 [2022-12-13 21:29:59,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:30:08,268 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1151] $Ultimate##0-->L693-1: Formula: (and (= |v_thrThread3of4ForFork0_#in~arg.offset_5| v_thrThread3of4ForFork0_~arg.offset_5) (= |v_#race~x~0_63| 0) (= v_thrThread3of4ForFork0_~arg.base_5 |v_thrThread3of4ForFork0_#in~arg.base_5|)) InVars {thrThread3of4ForFork0_#in~arg.base=|v_thrThread3of4ForFork0_#in~arg.base_5|, thrThread3of4ForFork0_#in~arg.offset=|v_thrThread3of4ForFork0_#in~arg.offset_5|} OutVars{#race~x~0=|v_#race~x~0_63|, thrThread3of4ForFork0_#in~arg.base=|v_thrThread3of4ForFork0_#in~arg.base_5|, thrThread3of4ForFork0_~arg.offset=v_thrThread3of4ForFork0_~arg.offset_5, thrThread3of4ForFork0_~arg.base=v_thrThread3of4ForFork0_~arg.base_5, thrThread3of4ForFork0_#in~arg.offset=|v_thrThread3of4ForFork0_#in~arg.offset_5|} AuxVars[] AssignedVars[#race~x~0, thrThread3of4ForFork0_~arg.offset, thrThread3of4ForFork0_~arg.base][68], [65#L709-6true, thrThread1of4ForFork0InUse, 9#thrEXITtrue, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, 110#L693-1true, thrThread4of4ForFork0InUse, 97#L695-3true, Black: 186#true, 188#(= |#race~x~0| 0), 23#thrErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2022-12-13 21:30:08,268 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,268 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,268 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,268 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,289 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1182] $Ultimate##0-->L693-1: Formula: (and (= |v_thrThread2of4ForFork0_#in~arg.offset_5| v_thrThread2of4ForFork0_~arg.offset_5) (= |v_thrThread2of4ForFork0_#in~arg.base_5| v_thrThread2of4ForFork0_~arg.base_5) (= |v_#race~x~0_67| 0)) InVars {thrThread2of4ForFork0_#in~arg.base=|v_thrThread2of4ForFork0_#in~arg.base_5|, thrThread2of4ForFork0_#in~arg.offset=|v_thrThread2of4ForFork0_#in~arg.offset_5|} OutVars{thrThread2of4ForFork0_#in~arg.base=|v_thrThread2of4ForFork0_#in~arg.base_5|, #race~x~0=|v_#race~x~0_67|, thrThread2of4ForFork0_~arg.base=v_thrThread2of4ForFork0_~arg.base_5, thrThread2of4ForFork0_~arg.offset=v_thrThread2of4ForFork0_~arg.offset_5, thrThread2of4ForFork0_#in~arg.offset=|v_thrThread2of4ForFork0_#in~arg.offset_5|} AuxVars[] AssignedVars[#race~x~0, thrThread2of4ForFork0_~arg.base, thrThread2of4ForFork0_~arg.offset][41], [65#L709-6true, thrThread1of4ForFork0InUse, 9#thrEXITtrue, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 76#L693-1true, 22#thrErr0ASSERT_VIOLATIONDATA_RACEtrue, 97#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:08,289 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,290 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,290 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,290 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2022-12-13 21:30:08,854 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1151] $Ultimate##0-->L693-1: Formula: (and (= |v_thrThread3of4ForFork0_#in~arg.offset_5| v_thrThread3of4ForFork0_~arg.offset_5) (= |v_#race~x~0_63| 0) (= v_thrThread3of4ForFork0_~arg.base_5 |v_thrThread3of4ForFork0_#in~arg.base_5|)) InVars {thrThread3of4ForFork0_#in~arg.base=|v_thrThread3of4ForFork0_#in~arg.base_5|, thrThread3of4ForFork0_#in~arg.offset=|v_thrThread3of4ForFork0_#in~arg.offset_5|} OutVars{#race~x~0=|v_#race~x~0_63|, thrThread3of4ForFork0_#in~arg.base=|v_thrThread3of4ForFork0_#in~arg.base_5|, thrThread3of4ForFork0_~arg.offset=v_thrThread3of4ForFork0_~arg.offset_5, thrThread3of4ForFork0_~arg.base=v_thrThread3of4ForFork0_~arg.base_5, thrThread3of4ForFork0_#in~arg.offset=|v_thrThread3of4ForFork0_#in~arg.offset_5|} AuxVars[] AssignedVars[#race~x~0, thrThread3of4ForFork0_~arg.offset, thrThread3of4ForFork0_~arg.base][68], [thrThread1of4ForFork0InUse, 9#thrEXITtrue, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 110#L693-1true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 97#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true, 23#thrErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2022-12-13 21:30:08,855 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 21:30:08,855 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:30:08,855 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:30:08,855 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:30:08,873 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1182] $Ultimate##0-->L693-1: Formula: (and (= |v_thrThread2of4ForFork0_#in~arg.offset_5| v_thrThread2of4ForFork0_~arg.offset_5) (= |v_thrThread2of4ForFork0_#in~arg.base_5| v_thrThread2of4ForFork0_~arg.base_5) (= |v_#race~x~0_67| 0)) InVars {thrThread2of4ForFork0_#in~arg.base=|v_thrThread2of4ForFork0_#in~arg.base_5|, thrThread2of4ForFork0_#in~arg.offset=|v_thrThread2of4ForFork0_#in~arg.offset_5|} OutVars{thrThread2of4ForFork0_#in~arg.base=|v_thrThread2of4ForFork0_#in~arg.base_5|, #race~x~0=|v_#race~x~0_67|, thrThread2of4ForFork0_~arg.base=v_thrThread2of4ForFork0_~arg.base_5, thrThread2of4ForFork0_~arg.offset=v_thrThread2of4ForFork0_~arg.offset_5, thrThread2of4ForFork0_#in~arg.offset=|v_thrThread2of4ForFork0_#in~arg.offset_5|} AuxVars[] AssignedVars[#race~x~0, thrThread2of4ForFork0_~arg.base, thrThread2of4ForFork0_~arg.offset][41], [thrThread1of4ForFork0InUse, 9#thrEXITtrue, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 76#L693-1true, 22#thrErr0ASSERT_VIOLATIONDATA_RACEtrue, 97#L695-3true, Black: 186#true, 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:08,873 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 21:30:08,873 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:30:08,873 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:30:08,874 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 21:30:11,011 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1174] L694-->L694-2: Formula: (= (store |v_#memory_int_176| |v_~#a~0.base_136| (store (select |v_#memory_int_176| |v_~#a~0.base_136|) (+ |v_~#a~0.offset_135| (* v_thrThread3of4ForFork0_~t~0_23 4)) 1)) |v_#memory_int_175|) InVars {#memory_int=|v_#memory_int_176|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} OutVars{thrThread3of4ForFork0_#t~nondet3=|v_thrThread3of4ForFork0_#t~nondet3_23|, #memory_int=|v_#memory_int_175|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet3, #memory_int][77], [120#thrErr0ASSERT_VIOLATIONDATA_RACEtrue, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 194#(<= |ULTIMATE.start_main_~i~0#1| 0), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 84#thrEXITtrue, 13#L694-2true, 97#L695-3true, 54#L706-1true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:11,011 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,011 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,011 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,011 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,015 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1174] L694-->L694-2: Formula: (= (store |v_#memory_int_176| |v_~#a~0.base_136| (store (select |v_#memory_int_176| |v_~#a~0.base_136|) (+ |v_~#a~0.offset_135| (* v_thrThread3of4ForFork0_~t~0_23 4)) 1)) |v_#memory_int_175|) InVars {#memory_int=|v_#memory_int_176|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} OutVars{thrThread3of4ForFork0_#t~nondet3=|v_thrThread3of4ForFork0_#t~nondet3_23|, #memory_int=|v_#memory_int_175|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet3, #memory_int][78], [120#thrErr0ASSERT_VIOLATIONDATA_RACEtrue, 65#L709-6true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 13#L694-2true, 84#thrEXITtrue, 97#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:11,016 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,016 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,016 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,016 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 21:30:11,259 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1174] L694-->L694-2: Formula: (= (store |v_#memory_int_176| |v_~#a~0.base_136| (store (select |v_#memory_int_176| |v_~#a~0.base_136|) (+ |v_~#a~0.offset_135| (* v_thrThread3of4ForFork0_~t~0_23 4)) 1)) |v_#memory_int_175|) InVars {#memory_int=|v_#memory_int_176|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} OutVars{thrThread3of4ForFork0_#t~nondet3=|v_thrThread3of4ForFork0_#t~nondet3_23|, #memory_int=|v_#memory_int_175|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet3, #memory_int][78], [120#thrErr0ASSERT_VIOLATIONDATA_RACEtrue, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 84#thrEXITtrue, 13#L694-2true, 97#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:11,259 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2022-12-13 21:30:11,259 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 21:30:11,259 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 21:30:11,259 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 21:30:11,460 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [57#L694-2true, 65#L709-6true, thrThread1of4ForFork0InUse, 124#L695-3true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 169#L695-3true, 13#L694-2true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:11,460 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2022-12-13 21:30:11,460 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 21:30:11,460 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 21:30:11,460 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-13 21:30:12,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [57#L694-2true, thrThread1of4ForFork0InUse, 124#L695-3true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 169#L695-3true, 13#L694-2true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:12,263 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 21:30:12,263 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 21:30:12,263 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 21:30:12,263 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 21:30:12,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [65#L709-6true, 57#L694-2true, 9#thrEXITtrue, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 169#L695-3true, 13#L694-2true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:12,295 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2022-12-13 21:30:12,295 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 21:30:12,295 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 21:30:12,295 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2022-12-13 21:30:13,183 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [57#L694-2true, 9#thrEXITtrue, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 169#L695-3true, 13#L694-2true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:13,183 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2022-12-13 21:30:13,183 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 21:30:13,183 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 21:30:13,183 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-12-13 21:30:15,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [57#L694-2true, 65#L709-6true, thrThread1of4ForFork0InUse, 114#L695true, 124#L695-3true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 169#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:15,180 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2022-12-13 21:30:15,180 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:15,180 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:15,180 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:15,765 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [57#L694-2true, thrThread1of4ForFork0InUse, 124#L695-3true, 114#L695true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 169#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:15,765 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2022-12-13 21:30:15,765 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:15,765 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:15,765 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:16,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [57#L694-2true, 65#L709-6true, thrThread1of4ForFork0InUse, 9#thrEXITtrue, 114#L695true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 169#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:16,144 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2022-12-13 21:30:16,144 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:16,144 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:16,144 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:16,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][125], [65#L709-6true, thrThread1of4ForFork0InUse, 124#L695-3true, 172#L695-3true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 169#L695-3true, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:16,169 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,169 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,169 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,169 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1174] L694-->L694-2: Formula: (= (store |v_#memory_int_176| |v_~#a~0.base_136| (store (select |v_#memory_int_176| |v_~#a~0.base_136|) (+ |v_~#a~0.offset_135| (* v_thrThread3of4ForFork0_~t~0_23 4)) 1)) |v_#memory_int_175|) InVars {#memory_int=|v_#memory_int_176|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} OutVars{thrThread3of4ForFork0_#t~nondet3=|v_thrThread3of4ForFork0_#t~nondet3_23|, #memory_int=|v_#memory_int_175|, ~#a~0.base=|v_~#a~0.base_136|, thrThread3of4ForFork0_~t~0=v_thrThread3of4ForFork0_~t~0_23, ~#a~0.offset=|v_~#a~0.offset_135|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet3, #memory_int][77], [120#thrErr0ASSERT_VIOLATIONDATA_RACEtrue, 40#L706-7true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 194#(<= |ULTIMATE.start_main_~i~0#1| 0), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 13#L694-2true, 97#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:16,453 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,453 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,453 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,453 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-12-13 21:30:16,707 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][106], [57#L694-2true, thrThread1of4ForFork0InUse, 9#thrEXITtrue, 114#L695true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 169#L695-3true, 188#(= |#race~x~0| 0), Black: 186#true]) [2022-12-13 21:30:16,707 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2022-12-13 21:30:16,708 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:16,708 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:16,708 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:17,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][125], [thrThread1of4ForFork0InUse, 124#L695-3true, 172#L695-3true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 169#L695-3true, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:17,133 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,133 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,133 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,133 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][125], [65#L709-6true, 9#thrEXITtrue, thrThread1of4ForFork0InUse, 172#L695-3true, thrThread2of4ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 169#L695-3true, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:17,170 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,170 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,170 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,170 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][115], [4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 141#L693-2true, thrThread3of4ForFork0InUse, 12#L705-5true, thrThread4of4ForFork0InUse, 192#true, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:17,272 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is not cut-off event [2022-12-13 21:30:17,272 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2022-12-13 21:30:17,272 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2022-12-13 21:30:17,272 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2022-12-13 21:30:17,273 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][115], [4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 192#true, 186#true, 54#L706-1true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:17,273 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,273 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,273 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,273 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,273 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][124], [65#L709-6true, 4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 194#(<= |ULTIMATE.start_main_~i~0#1| 0), 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:17,273 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,273 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,273 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:17,273 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-12-13 21:30:18,005 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][125], [9#thrEXITtrue, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 172#L695-3true, 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 169#L695-3true, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:18,005 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,005 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,005 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,005 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][124], [4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 194#(<= |ULTIMATE.start_main_~i~0#1| 0), 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 186#true, 87#L710-1true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:18,115 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,116 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,116 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,116 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,116 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][124], [4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 194#(<= |ULTIMATE.start_main_~i~0#1| 0), 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:18,116 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,116 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,116 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:18,116 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-12-13 21:30:22,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][115], [65#L709-6true, 4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 192#true, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:22,141 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2022-12-13 21:30:22,141 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-13 21:30:22,141 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-13 21:30:22,142 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-12-13 21:30:23,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][115], [4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 141#L693-2true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 192#true, 186#true, 87#L710-1true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:23,153 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-12-13 21:30:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-13 21:30:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-13 21:30:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-13 21:30:23,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L695-1-->L695-3: Formula: (= |v_thrThread3of4ForFork0_#t~nondet4_13| |v_#race~x~0_61|) InVars {} OutVars{thrThread3of4ForFork0_#t~nondet4=|v_thrThread3of4ForFork0_#t~nondet4_13|, #race~x~0=|v_#race~x~0_61|} AuxVars[] AssignedVars[thrThread3of4ForFork0_#t~nondet4, #race~x~0][115], [4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0NotInUse, 172#L695-3true, 141#L693-2true, thrThread3of4ForFork0InUse, 3#ULTIMATE.startEXITtrue, thrThread4of4ForFork0InUse, 192#true, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:23,153 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-12-13 21:30:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-13 21:30:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-13 21:30:23,154 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-12-13 21:30:24,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][90], [57#L694-2true, 4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0NotInUse, thrThread4of4ForFork0InUse, 192#true, 105#L695-2true, 87#L710-1true, Black: 186#true, 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:24,343 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,344 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,344 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,344 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,344 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][90], [57#L694-2true, 4#L693-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0NotInUse, 3#ULTIMATE.startEXITtrue, thrThread4of4ForFork0InUse, 192#true, 105#L695-2true, Black: 186#true, 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:24,344 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,344 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,344 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,344 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1197] L695-3-->thrEXIT: Formula: (= |v_thrThread2of4ForFork0_#t~nondet4_18| |v_#race~x~0_75|) InVars {#race~x~0=|v_#race~x~0_75|, thrThread2of4ForFork0_#t~nondet4=|v_thrThread2of4ForFork0_#t~nondet4_18|} OutVars{#race~x~0=|v_#race~x~0_75|} AuxVars[] AssignedVars[thrThread2of4ForFork0_#t~nondet4][93], [thrThread1of4ForFork0InUse, 4#L693-2true, thrThread2of4ForFork0InUse, 141#L693-2true, thrThread3of4ForFork0NotInUse, thrThread4of4ForFork0InUse, 192#true, 84#thrEXITtrue, 186#true, 87#L710-1true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:24,346 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,346 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,346 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,346 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1197] L695-3-->thrEXIT: Formula: (= |v_thrThread2of4ForFork0_#t~nondet4_18| |v_#race~x~0_75|) InVars {#race~x~0=|v_#race~x~0_75|, thrThread2of4ForFork0_#t~nondet4=|v_thrThread2of4ForFork0_#t~nondet4_18|} OutVars{#race~x~0=|v_#race~x~0_75|} AuxVars[] AssignedVars[thrThread2of4ForFork0_#t~nondet4][93], [thrThread1of4ForFork0InUse, 4#L693-2true, thrThread2of4ForFork0InUse, 141#L693-2true, thrThread3of4ForFork0NotInUse, 3#ULTIMATE.startEXITtrue, thrThread4of4ForFork0InUse, 192#true, 84#thrEXITtrue, 186#true, Black: 188#(= |#race~x~0| 0)]) [2022-12-13 21:30:24,346 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,347 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,347 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:24,347 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-13 21:30:32,514 INFO L130 PetriNetUnfolder]: 220787/436660 cut-off events. [2022-12-13 21:30:32,514 INFO L131 PetriNetUnfolder]: For 158193/161056 co-relation queries the response was YES. [2022-12-13 21:30:33,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868578 conditions, 436660 events. 220787/436660 cut-off events. For 158193/161056 co-relation queries the response was YES. Maximal size of possible extension queue 10810. Compared 5773406 event pairs, 77949 based on Foata normal form. 5/375875 useless extension candidates. Maximal degree in co-relation 113775. Up to 140146 conditions per place. [2022-12-13 21:30:35,239 INFO L137 encePairwiseOnDemand]: 284/292 looper letters, 102 selfloop transitions, 7 changer transitions 2/171 dead transitions. [2022-12-13 21:30:35,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 171 transitions, 772 flow [2022-12-13 21:30:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:30:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:30:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 727 transitions. [2022-12-13 21:30:35,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.622431506849315 [2022-12-13 21:30:35,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 727 transitions. [2022-12-13 21:30:35,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 727 transitions. [2022-12-13 21:30:35,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:30:35,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 727 transitions. [2022-12-13 21:30:35,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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 21:30:35,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 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 21:30:35,244 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 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 21:30:35,244 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 332 flow. Second operand 4 states and 727 transitions. [2022-12-13 21:30:35,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 171 transitions, 772 flow [2022-12-13 21:30:36,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 171 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:30:36,074 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 348 flow [2022-12-13 21:30:36,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2022-12-13 21:30:36,074 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2022-12-13 21:30:36,074 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 348 flow [2022-12-13 21:30:36,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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 21:30:36,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:30:36,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:30:36,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:30:36,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2022-12-13 21:30:36,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:30:36,075 INFO L85 PathProgramCache]: Analyzing trace with hash -778510020, now seen corresponding path program 1 times [2022-12-13 21:30:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:30:36,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273416936] [2022-12-13 21:30:36,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:30:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:30:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:30:36,208 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 21:30:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:30:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273416936] [2022-12-13 21:30:36,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273416936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:30:36,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:30:36,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:30:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662198669] [2022-12-13 21:30:36,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:30:36,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:30:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:30:36,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:30:36,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:30:36,408 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 292 [2022-12-13 21:30:36,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 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 21:30:36,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:30:36,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 292 [2022-12-13 21:30:36,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:32:19,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L694-->L694-2: Formula: (= (store |v_#memory_int_166| |v_~#a~0.base_122| (store (select |v_#memory_int_166| |v_~#a~0.base_122|) (+ |v_~#a~0.offset_121| (* v_thrThread4of4ForFork0_~t~0_21 4)) 1)) |v_#memory_int_165|) InVars {#memory_int=|v_#memory_int_166|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} OutVars{thrThread4of4ForFork0_#t~nondet3=|v_thrThread4of4ForFork0_#t~nondet3_19|, #memory_int=|v_#memory_int_165|, ~#a~0.base=|v_~#a~0.base_122|, thrThread4of4ForFork0_~t~0=v_thrThread4of4ForFork0_~t~0_21, ~#a~0.offset=|v_~#a~0.offset_121|} AuxVars[] AssignedVars[thrThread4of4ForFork0_#t~nondet3, #memory_int][164], [201#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of4ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of4ForFork0_#t~nondet3|), Black: 194#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 192#true, 109#thrEXITtrue, 150#L703-4true, 57#L694-2true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 169#L695-3true, 11#L694-3true, Black: 186#true]) [2022-12-13 21:32:19,581 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2022-12-13 21:32:19,581 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:32:19,581 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-13 21:32:19,581 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event