./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a 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_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc --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 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b --- 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-5e519f3 [2022-11-02 20:35:12,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:35:12,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:35:12,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:35:12,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:35:12,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:35:12,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:35:12,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:35:12,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:35:12,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:35:12,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:35:12,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:35:12,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:35:12,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:35:12,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:35:12,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:35:12,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:35:12,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:35:12,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:35:12,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:35:12,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:35:12,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:35:12,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:35:12,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:35:12,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:35:12,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:35:12,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:35:12,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:35:12,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:35:12,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:35:12,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:35:12,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:35:12,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:35:12,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:35:12,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:35:12,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:35:12,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:35:12,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:35:12,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:35:12,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:35:12,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:35:12,221 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:35:12,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:35:12,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:35:12,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:35:12,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:35:12,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:35:12,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:35:12,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:35:12,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:35:12,247 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:35:12,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:35:12,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:35:12,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:35:12,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:35:12,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:35:12,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:35:12,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:35:12,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:35:12,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:35:12,249 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:35:12,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:35:12,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:35:12,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:35:12,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:35:12,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:35:12,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:35:12,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:35:12,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:12,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:35:12,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:35:12,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:35:12,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:35:12,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:35:12,252 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:35:12,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:35:12,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:35:12,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/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_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc 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 -> 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b [2022-11-02 20:35:12,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:35:12,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:35:12,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:35:12,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:35:12,625 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:35:12,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2022-11-02 20:35:12,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/data/4bccd8c9a/594d628f187e41c6b400c67c2a1162fd/FLAGb0b6f6b9f [2022-11-02 20:35:13,112 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:35:13,113 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2022-11-02 20:35:13,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/data/4bccd8c9a/594d628f187e41c6b400c67c2a1162fd/FLAGb0b6f6b9f [2022-11-02 20:35:13,490 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/data/4bccd8c9a/594d628f187e41c6b400c67c2a1162fd [2022-11-02 20:35:13,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:35:13,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:35:13,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:13,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:35:13,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:35:13,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41cdca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13, skipping insertion in model container [2022-11-02 20:35:13,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:35:13,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:35:13,763 WARN L230 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_1996e8ff-e9a5-4155-b4ec-198fcef79348/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-11-02 20:35:13,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:13,778 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:35:13,812 WARN L230 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_1996e8ff-e9a5-4155-b4ec-198fcef79348/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-11-02 20:35:13,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:13,833 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:35:13,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13 WrapperNode [2022-11-02 20:35:13,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:13,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:13,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:35:13,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:35:13,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,890 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 342 [2022-11-02 20:35:13,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:13,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:35:13,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:35:13,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:35:13,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:35:13,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:35:13,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:35:13,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:35:13,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (1/1) ... [2022-11-02 20:35:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:14,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:14,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:35:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:35:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:35:14,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:35:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:35:14,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:35:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:35:14,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:35:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:35:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:35:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:35:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:35:14,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:35:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:35:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:35:14,094 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:35:14,300 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:35:14,303 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:35:14,974 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:35:15,007 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:35:15,007 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:35:15,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:15 BoogieIcfgContainer [2022-11-02 20:35:15,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:35:15,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:35:15,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:35:15,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:35:15,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:35:13" (1/3) ... [2022-11-02 20:35:15,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa7b718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:15, skipping insertion in model container [2022-11-02 20:35:15,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:13" (2/3) ... [2022-11-02 20:35:15,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa7b718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:15, skipping insertion in model container [2022-11-02 20:35:15,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:15" (3/3) ... [2022-11-02 20:35:15,034 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2022-11-02 20:35:15,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:35:15,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:35:15,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-02 20:35:15,069 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:35:15,315 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:35:15,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 446 transitions, 916 flow [2022-11-02 20:35:15,550 INFO L130 PetriNetUnfolder]: 27/443 cut-off events. [2022-11-02 20:35:15,551 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:35:15,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 443 events. 27/443 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1308 event pairs, 0 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 296. Up to 2 conditions per place. [2022-11-02 20:35:15,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 446 transitions, 916 flow [2022-11-02 20:35:15,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 404 places, 419 transitions, 856 flow [2022-11-02 20:35:15,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:35:15,596 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;@309fe853, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:35:15,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-02 20:35:15,602 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-11-02 20:35:15,602 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:35:15,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:15,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:15,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1469766472, now seen corresponding path program 1 times [2022-11-02 20:35:15,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:15,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500743540] [2022-11-02 20:35:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:15,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500743540] [2022-11-02 20:35:15,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500743540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:15,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:15,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118105286] [2022-11-02 20:35:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:15,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:15,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:15,880 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 446 [2022-11-02 20:35:15,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 419 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:15,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:15,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 446 [2022-11-02 20:35:15,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:16,352 INFO L130 PetriNetUnfolder]: 57/982 cut-off events. [2022-11-02 20:35:16,353 INFO L131 PetriNetUnfolder]: For 53/55 co-relation queries the response was YES. [2022-11-02 20:35:16,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 982 events. 57/982 cut-off events. For 53/55 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5144 event pairs, 21 based on Foata normal form. 32/865 useless extension candidates. Maximal degree in co-relation 781. Up to 63 conditions per place. [2022-11-02 20:35:16,379 INFO L137 encePairwiseOnDemand]: 437/446 looper letters, 15 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2022-11-02 20:35:16,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 412 transitions, 876 flow [2022-11-02 20:35:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-02 20:35:16,405 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9596412556053812 [2022-11-02 20:35:16,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-02 20:35:16,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-02 20:35:16,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:16,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-02 20:35:16,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:16,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:16,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:16,439 INFO L175 Difference]: Start difference. First operand has 404 places, 419 transitions, 856 flow. Second operand 3 states and 1284 transitions. [2022-11-02 20:35:16,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 412 transitions, 876 flow [2022-11-02 20:35:16,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 412 transitions, 864 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:35:16,462 INFO L231 Difference]: Finished difference. Result has 399 places, 412 transitions, 834 flow [2022-11-02 20:35:16,467 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=399, PETRI_TRANSITIONS=412} [2022-11-02 20:35:16,473 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -5 predicate places. [2022-11-02 20:35:16,473 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 412 transitions, 834 flow [2022-11-02 20:35:16,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:16,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:16,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:16,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:35:16,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1682833523, now seen corresponding path program 1 times [2022-11-02 20:35:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707980875] [2022-11-02 20:35:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:16,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:16,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707980875] [2022-11-02 20:35:16,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707980875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:16,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:16,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090780615] [2022-11-02 20:35:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:16,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:16,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:16,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:16,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:16,634 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 446 [2022-11-02 20:35:16,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:16,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:16,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 446 [2022-11-02 20:35:16,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:17,079 INFO L130 PetriNetUnfolder]: 87/1364 cut-off events. [2022-11-02 20:35:17,079 INFO L131 PetriNetUnfolder]: For 11/16 co-relation queries the response was YES. [2022-11-02 20:35:17,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 1364 events. 87/1364 cut-off events. For 11/16 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9002 event pairs, 39 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 1441. Up to 90 conditions per place. [2022-11-02 20:35:17,109 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 15 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2022-11-02 20:35:17,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 411 transitions, 866 flow [2022-11-02 20:35:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2022-11-02 20:35:17,115 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9551569506726457 [2022-11-02 20:35:17,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1278 transitions. [2022-11-02 20:35:17,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1278 transitions. [2022-11-02 20:35:17,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:17,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1278 transitions. [2022-11-02 20:35:17,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,128 INFO L175 Difference]: Start difference. First operand has 399 places, 412 transitions, 834 flow. Second operand 3 states and 1278 transitions. [2022-11-02 20:35:17,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 411 transitions, 866 flow [2022-11-02 20:35:17,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 411 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:17,142 INFO L231 Difference]: Finished difference. Result has 398 places, 411 transitions, 832 flow [2022-11-02 20:35:17,144 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=398, PETRI_TRANSITIONS=411} [2022-11-02 20:35:17,145 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -6 predicate places. [2022-11-02 20:35:17,145 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 411 transitions, 832 flow [2022-11-02 20:35:17,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:17,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:17,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:35:17,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -243174264, now seen corresponding path program 1 times [2022-11-02 20:35:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:17,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33245299] [2022-11-02 20:35:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33245299] [2022-11-02 20:35:17,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33245299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:17,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:17,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870516783] [2022-11-02 20:35:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:17,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:17,271 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 446 [2022-11-02 20:35:17,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 411 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:17,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 446 [2022-11-02 20:35:17,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:17,635 INFO L130 PetriNetUnfolder]: 69/1055 cut-off events. [2022-11-02 20:35:17,635 INFO L131 PetriNetUnfolder]: For 26/34 co-relation queries the response was YES. [2022-11-02 20:35:17,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 1055 events. 69/1055 cut-off events. For 26/34 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5784 event pairs, 39 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1110. Up to 90 conditions per place. [2022-11-02 20:35:17,661 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 15 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-11-02 20:35:17,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 410 transitions, 864 flow [2022-11-02 20:35:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2022-11-02 20:35:17,671 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9551569506726457 [2022-11-02 20:35:17,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1278 transitions. [2022-11-02 20:35:17,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1278 transitions. [2022-11-02 20:35:17,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:17,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1278 transitions. [2022-11-02 20:35:17,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,683 INFO L175 Difference]: Start difference. First operand has 398 places, 411 transitions, 832 flow. Second operand 3 states and 1278 transitions. [2022-11-02 20:35:17,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 410 transitions, 864 flow [2022-11-02 20:35:17,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 410 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:17,692 INFO L231 Difference]: Finished difference. Result has 397 places, 410 transitions, 830 flow [2022-11-02 20:35:17,693 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=397, PETRI_TRANSITIONS=410} [2022-11-02 20:35:17,696 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -7 predicate places. [2022-11-02 20:35:17,696 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 410 transitions, 830 flow [2022-11-02 20:35:17,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:17,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:17,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:35:17,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash -910375576, now seen corresponding path program 1 times [2022-11-02 20:35:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:17,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519291810] [2022-11-02 20:35:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:17,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519291810] [2022-11-02 20:35:17,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519291810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:17,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:17,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425529222] [2022-11-02 20:35:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:17,798 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 446 [2022-11-02 20:35:17,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 410 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:17,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:17,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 446 [2022-11-02 20:35:17,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:18,072 INFO L130 PetriNetUnfolder]: 82/1039 cut-off events. [2022-11-02 20:35:18,073 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:35:18,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1039 events. 82/1039 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5774 event pairs, 21 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1058. Up to 58 conditions per place. [2022-11-02 20:35:18,110 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 15 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2022-11-02 20:35:18,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 409 transitions, 862 flow [2022-11-02 20:35:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2022-11-02 20:35:18,116 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9551569506726457 [2022-11-02 20:35:18,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1278 transitions. [2022-11-02 20:35:18,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1278 transitions. [2022-11-02 20:35:18,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:18,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1278 transitions. [2022-11-02 20:35:18,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,129 INFO L175 Difference]: Start difference. First operand has 397 places, 410 transitions, 830 flow. Second operand 3 states and 1278 transitions. [2022-11-02 20:35:18,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 409 transitions, 862 flow [2022-11-02 20:35:18,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 409 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:18,138 INFO L231 Difference]: Finished difference. Result has 396 places, 409 transitions, 828 flow [2022-11-02 20:35:18,139 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=396, PETRI_TRANSITIONS=409} [2022-11-02 20:35:18,146 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -8 predicate places. [2022-11-02 20:35:18,147 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 409 transitions, 828 flow [2022-11-02 20:35:18,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:18,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:18,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:35:18,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash -970101585, now seen corresponding path program 1 times [2022-11-02 20:35:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:18,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894344608] [2022-11-02 20:35:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:18,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:18,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894344608] [2022-11-02 20:35:18,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894344608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:18,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:18,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076355759] [2022-11-02 20:35:18,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:18,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:18,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:18,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:18,200 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 446 [2022-11-02 20:35:18,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 409 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:18,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 446 [2022-11-02 20:35:18,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:18,628 INFO L130 PetriNetUnfolder]: 187/1862 cut-off events. [2022-11-02 20:35:18,628 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:35:18,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1862 events. 187/1862 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15095 event pairs, 72 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 1989. Up to 145 conditions per place. [2022-11-02 20:35:18,669 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 18 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-11-02 20:35:18,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 408 transitions, 866 flow [2022-11-02 20:35:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2022-11-02 20:35:18,674 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9506726457399103 [2022-11-02 20:35:18,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1272 transitions. [2022-11-02 20:35:18,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1272 transitions. [2022-11-02 20:35:18,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:18,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1272 transitions. [2022-11-02 20:35:18,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,683 INFO L175 Difference]: Start difference. First operand has 396 places, 409 transitions, 828 flow. Second operand 3 states and 1272 transitions. [2022-11-02 20:35:18,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 408 transitions, 866 flow [2022-11-02 20:35:18,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 408 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:18,698 INFO L231 Difference]: Finished difference. Result has 395 places, 408 transitions, 826 flow [2022-11-02 20:35:18,699 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=395, PETRI_TRANSITIONS=408} [2022-11-02 20:35:18,702 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -9 predicate places. [2022-11-02 20:35:18,702 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 408 transitions, 826 flow [2022-11-02 20:35:18,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:18,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:18,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:35:18,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2079067841, now seen corresponding path program 1 times [2022-11-02 20:35:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:18,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330232845] [2022-11-02 20:35:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:18,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330232845] [2022-11-02 20:35:18,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330232845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:18,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:18,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146616429] [2022-11-02 20:35:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:18,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:18,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:18,821 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 446 [2022-11-02 20:35:18,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:18,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 446 [2022-11-02 20:35:18,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:19,419 INFO L130 PetriNetUnfolder]: 259/2003 cut-off events. [2022-11-02 20:35:19,419 INFO L131 PetriNetUnfolder]: For 57/65 co-relation queries the response was YES. [2022-11-02 20:35:19,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 2003 events. 259/2003 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 15662 event pairs, 132 based on Foata normal form. 0/1593 useless extension candidates. Maximal degree in co-relation 2202. Up to 250 conditions per place. [2022-11-02 20:35:19,458 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 21 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2022-11-02 20:35:19,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 407 transitions, 870 flow [2022-11-02 20:35:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2022-11-02 20:35:19,461 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9461883408071748 [2022-11-02 20:35:19,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1266 transitions. [2022-11-02 20:35:19,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1266 transitions. [2022-11-02 20:35:19,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:19,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1266 transitions. [2022-11-02 20:35:19,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 422.0) internal successors, (1266), 3 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,471 INFO L175 Difference]: Start difference. First operand has 395 places, 408 transitions, 826 flow. Second operand 3 states and 1266 transitions. [2022-11-02 20:35:19,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 407 transitions, 870 flow [2022-11-02 20:35:19,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 407 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:19,480 INFO L231 Difference]: Finished difference. Result has 394 places, 407 transitions, 824 flow [2022-11-02 20:35:19,480 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=394, PETRI_TRANSITIONS=407} [2022-11-02 20:35:19,481 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -10 predicate places. [2022-11-02 20:35:19,481 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 407 transitions, 824 flow [2022-11-02 20:35:19,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:19,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:19,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:35:19,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1610230663, now seen corresponding path program 1 times [2022-11-02 20:35:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:19,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930245101] [2022-11-02 20:35:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930245101] [2022-11-02 20:35:19,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930245101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:19,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:19,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508868472] [2022-11-02 20:35:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:19,529 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 446 [2022-11-02 20:35:19,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 407 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:19,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 446 [2022-11-02 20:35:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:19,809 INFO L130 PetriNetUnfolder]: 78/1093 cut-off events. [2022-11-02 20:35:19,809 INFO L131 PetriNetUnfolder]: For 14/17 co-relation queries the response was YES. [2022-11-02 20:35:19,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 1093 events. 78/1093 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6540 event pairs, 21 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1099. Up to 63 conditions per place. [2022-11-02 20:35:19,831 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 15 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2022-11-02 20:35:19,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 406 transitions, 856 flow [2022-11-02 20:35:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2022-11-02 20:35:19,835 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9551569506726457 [2022-11-02 20:35:19,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1278 transitions. [2022-11-02 20:35:19,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1278 transitions. [2022-11-02 20:35:19,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:19,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1278 transitions. [2022-11-02 20:35:19,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,843 INFO L175 Difference]: Start difference. First operand has 394 places, 407 transitions, 824 flow. Second operand 3 states and 1278 transitions. [2022-11-02 20:35:19,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 406 transitions, 856 flow [2022-11-02 20:35:19,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 406 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:19,851 INFO L231 Difference]: Finished difference. Result has 393 places, 406 transitions, 822 flow [2022-11-02 20:35:19,852 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=393, PETRI_TRANSITIONS=406} [2022-11-02 20:35:19,853 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -11 predicate places. [2022-11-02 20:35:19,853 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 406 transitions, 822 flow [2022-11-02 20:35:19,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:19,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:19,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:35:19,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:19,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1279770964, now seen corresponding path program 1 times [2022-11-02 20:35:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:19,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380524596] [2022-11-02 20:35:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:19,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380524596] [2022-11-02 20:35:19,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380524596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:19,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:19,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768346385] [2022-11-02 20:35:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:19,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:19,901 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 446 [2022-11-02 20:35:19,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 406 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:19,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:19,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 446 [2022-11-02 20:35:19,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:20,385 INFO L130 PetriNetUnfolder]: 207/2537 cut-off events. [2022-11-02 20:35:20,385 INFO L131 PetriNetUnfolder]: For 11/22 co-relation queries the response was YES. [2022-11-02 20:35:20,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 2537 events. 207/2537 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 23384 event pairs, 72 based on Foata normal form. 0/2099 useless extension candidates. Maximal degree in co-relation 2651. Up to 150 conditions per place. [2022-11-02 20:35:20,430 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 18 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2022-11-02 20:35:20,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 405 transitions, 860 flow [2022-11-02 20:35:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2022-11-02 20:35:20,433 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9506726457399103 [2022-11-02 20:35:20,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1272 transitions. [2022-11-02 20:35:20,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1272 transitions. [2022-11-02 20:35:20,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:20,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1272 transitions. [2022-11-02 20:35:20,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:20,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:20,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:20,441 INFO L175 Difference]: Start difference. First operand has 393 places, 406 transitions, 822 flow. Second operand 3 states and 1272 transitions. [2022-11-02 20:35:20,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 405 transitions, 860 flow [2022-11-02 20:35:20,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 405 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:20,449 INFO L231 Difference]: Finished difference. Result has 392 places, 405 transitions, 820 flow [2022-11-02 20:35:20,450 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=392, PETRI_TRANSITIONS=405} [2022-11-02 20:35:20,451 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -12 predicate places. [2022-11-02 20:35:20,451 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 405 transitions, 820 flow [2022-11-02 20:35:20,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:20,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:20,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:20,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:35:20,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:20,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2137402072, now seen corresponding path program 1 times [2022-11-02 20:35:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:20,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102464120] [2022-11-02 20:35:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:20,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102464120] [2022-11-02 20:35:20,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102464120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:20,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:20,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:20,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277976473] [2022-11-02 20:35:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:20,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:20,498 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 446 [2022-11-02 20:35:20,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 405 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:20,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:20,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 446 [2022-11-02 20:35:20,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:21,013 INFO L130 PetriNetUnfolder]: 201/1694 cut-off events. [2022-11-02 20:35:21,013 INFO L131 PetriNetUnfolder]: For 65/75 co-relation queries the response was YES. [2022-11-02 20:35:21,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1694 events. 201/1694 cut-off events. For 65/75 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 13583 event pairs, 132 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 1883. Up to 258 conditions per place. [2022-11-02 20:35:21,058 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 21 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2022-11-02 20:35:21,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 404 transitions, 864 flow [2022-11-02 20:35:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2022-11-02 20:35:21,063 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9461883408071748 [2022-11-02 20:35:21,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1266 transitions. [2022-11-02 20:35:21,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1266 transitions. [2022-11-02 20:35:21,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:21,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1266 transitions. [2022-11-02 20:35:21,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 422.0) internal successors, (1266), 3 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,074 INFO L175 Difference]: Start difference. First operand has 392 places, 405 transitions, 820 flow. Second operand 3 states and 1266 transitions. [2022-11-02 20:35:21,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 404 transitions, 864 flow [2022-11-02 20:35:21,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 404 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:21,087 INFO L231 Difference]: Finished difference. Result has 391 places, 404 transitions, 818 flow [2022-11-02 20:35:21,088 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=391, PETRI_TRANSITIONS=404} [2022-11-02 20:35:21,089 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -13 predicate places. [2022-11-02 20:35:21,089 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 404 transitions, 818 flow [2022-11-02 20:35:21,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:21,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:21,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:35:21,101 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 711622859, now seen corresponding path program 1 times [2022-11-02 20:35:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:21,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046135552] [2022-11-02 20:35:21,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:21,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:21,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046135552] [2022-11-02 20:35:21,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046135552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:21,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:21,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:21,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529000330] [2022-11-02 20:35:21,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:21,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:21,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:21,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:21,168 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 446 [2022-11-02 20:35:21,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 404 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:21,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 446 [2022-11-02 20:35:21,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:21,425 INFO L130 PetriNetUnfolder]: 73/1031 cut-off events. [2022-11-02 20:35:21,425 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:35:21,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 1031 events. 73/1031 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5761 event pairs, 8 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 988. Up to 31 conditions per place. [2022-11-02 20:35:21,448 INFO L137 encePairwiseOnDemand]: 442/446 looper letters, 14 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2022-11-02 20:35:21,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 406 transitions, 856 flow [2022-11-02 20:35:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2022-11-02 20:35:21,452 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9618834080717489 [2022-11-02 20:35:21,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2022-11-02 20:35:21,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2022-11-02 20:35:21,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:21,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2022-11-02 20:35:21,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,460 INFO L175 Difference]: Start difference. First operand has 391 places, 404 transitions, 818 flow. Second operand 3 states and 1287 transitions. [2022-11-02 20:35:21,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 406 transitions, 856 flow [2022-11-02 20:35:21,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 406 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:21,469 INFO L231 Difference]: Finished difference. Result has 390 places, 404 transitions, 824 flow [2022-11-02 20:35:21,470 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=390, PETRI_TRANSITIONS=404} [2022-11-02 20:35:21,470 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -14 predicate places. [2022-11-02 20:35:21,471 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 404 transitions, 824 flow [2022-11-02 20:35:21,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:21,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:21,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:35:21,472 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -955744, now seen corresponding path program 1 times [2022-11-02 20:35:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:21,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842834709] [2022-11-02 20:35:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:21,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842834709] [2022-11-02 20:35:21,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842834709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:21,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:21,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304065029] [2022-11-02 20:35:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:21,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:21,523 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 446 [2022-11-02 20:35:21,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 404 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:21,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 446 [2022-11-02 20:35:21,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:21,868 INFO L130 PetriNetUnfolder]: 159/1924 cut-off events. [2022-11-02 20:35:21,868 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:35:21,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1924 events. 159/1924 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15967 event pairs, 23 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1760. Up to 73 conditions per place. [2022-11-02 20:35:21,904 INFO L137 encePairwiseOnDemand]: 440/446 looper letters, 16 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2022-11-02 20:35:21,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 406 transitions, 868 flow [2022-11-02 20:35:21,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2022-11-02 20:35:21,908 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9581464872944694 [2022-11-02 20:35:21,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2022-11-02 20:35:21,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2022-11-02 20:35:21,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:21,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2022-11-02 20:35:21,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,916 INFO L175 Difference]: Start difference. First operand has 390 places, 404 transitions, 824 flow. Second operand 3 states and 1282 transitions. [2022-11-02 20:35:21,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 406 transitions, 868 flow [2022-11-02 20:35:21,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 406 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:21,925 INFO L231 Difference]: Finished difference. Result has 390 places, 404 transitions, 839 flow [2022-11-02 20:35:21,926 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=390, PETRI_TRANSITIONS=404} [2022-11-02 20:35:21,927 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -14 predicate places. [2022-11-02 20:35:21,927 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 404 transitions, 839 flow [2022-11-02 20:35:21,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:21,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:21,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:35:21,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1622849653, now seen corresponding path program 1 times [2022-11-02 20:35:21,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:21,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495136941] [2022-11-02 20:35:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:21,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495136941] [2022-11-02 20:35:21,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495136941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:21,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:21,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:21,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167771479] [2022-11-02 20:35:21,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:21,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:21,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:21,975 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 446 [2022-11-02 20:35:21,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 404 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:21,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 446 [2022-11-02 20:35:21,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:22,282 INFO L130 PetriNetUnfolder]: 76/1223 cut-off events. [2022-11-02 20:35:22,283 INFO L131 PetriNetUnfolder]: For 13/16 co-relation queries the response was YES. [2022-11-02 20:35:22,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1223 events. 76/1223 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7793 event pairs, 2 based on Foata normal form. 1/1046 useless extension candidates. Maximal degree in co-relation 1090. Up to 38 conditions per place. [2022-11-02 20:35:22,318 INFO L137 encePairwiseOnDemand]: 442/446 looper letters, 17 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2022-11-02 20:35:22,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 409 transitions, 892 flow [2022-11-02 20:35:22,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2022-11-02 20:35:22,322 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9641255605381166 [2022-11-02 20:35:22,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1290 transitions. [2022-11-02 20:35:22,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1290 transitions. [2022-11-02 20:35:22,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:22,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1290 transitions. [2022-11-02 20:35:22,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.0) internal successors, (1290), 3 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,329 INFO L175 Difference]: Start difference. First operand has 390 places, 404 transitions, 839 flow. Second operand 3 states and 1290 transitions. [2022-11-02 20:35:22,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 409 transitions, 892 flow [2022-11-02 20:35:22,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 409 transitions, 892 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:22,337 INFO L231 Difference]: Finished difference. Result has 391 places, 404 transitions, 849 flow [2022-11-02 20:35:22,338 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=391, PETRI_TRANSITIONS=404} [2022-11-02 20:35:22,339 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -13 predicate places. [2022-11-02 20:35:22,339 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 404 transitions, 849 flow [2022-11-02 20:35:22,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:22,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:22,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:35:22,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2131791826, now seen corresponding path program 1 times [2022-11-02 20:35:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:22,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896117230] [2022-11-02 20:35:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:22,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896117230] [2022-11-02 20:35:22,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896117230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:22,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:22,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382603223] [2022-11-02 20:35:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:22,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:22,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:22,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:22,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:22,385 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 446 [2022-11-02 20:35:22,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 404 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:22,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 446 [2022-11-02 20:35:22,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:22,855 INFO L130 PetriNetUnfolder]: 134/1986 cut-off events. [2022-11-02 20:35:22,855 INFO L131 PetriNetUnfolder]: For 16/22 co-relation queries the response was YES. [2022-11-02 20:35:22,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 1986 events. 134/1986 cut-off events. For 16/22 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 16219 event pairs, 10 based on Foata normal form. 2/1706 useless extension candidates. Maximal degree in co-relation 1936. Up to 94 conditions per place. [2022-11-02 20:35:22,909 INFO L137 encePairwiseOnDemand]: 440/446 looper letters, 19 selfloop transitions, 3 changer transitions 0/409 dead transitions. [2022-11-02 20:35:22,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 409 transitions, 908 flow [2022-11-02 20:35:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2022-11-02 20:35:22,913 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9603886397608371 [2022-11-02 20:35:22,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2022-11-02 20:35:22,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2022-11-02 20:35:22,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:22,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2022-11-02 20:35:22,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,921 INFO L175 Difference]: Start difference. First operand has 391 places, 404 transitions, 849 flow. Second operand 3 states and 1285 transitions. [2022-11-02 20:35:22,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 409 transitions, 908 flow [2022-11-02 20:35:22,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 409 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:22,930 INFO L231 Difference]: Finished difference. Result has 391 places, 404 transitions, 864 flow [2022-11-02 20:35:22,931 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=391, PETRI_TRANSITIONS=404} [2022-11-02 20:35:22,932 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -13 predicate places. [2022-11-02 20:35:22,932 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 404 transitions, 864 flow [2022-11-02 20:35:22,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:22,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:22,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:35:22,934 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash 139786264, now seen corresponding path program 1 times [2022-11-02 20:35:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:22,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225500919] [2022-11-02 20:35:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:22,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:22,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225500919] [2022-11-02 20:35:22,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225500919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:22,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:22,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:22,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219056100] [2022-11-02 20:35:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:22,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:22,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:22,996 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 446 [2022-11-02 20:35:22,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 404 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:22,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:22,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 446 [2022-11-02 20:35:22,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:23,992 INFO L130 PetriNetUnfolder]: 472/5645 cut-off events. [2022-11-02 20:35:23,992 INFO L131 PetriNetUnfolder]: For 69/81 co-relation queries the response was YES. [2022-11-02 20:35:24,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6139 conditions, 5645 events. 472/5645 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 62649 event pairs, 60 based on Foata normal form. 0/4808 useless extension candidates. Maximal degree in co-relation 5307. Up to 331 conditions per place. [2022-11-02 20:35:24,100 INFO L137 encePairwiseOnDemand]: 438/446 looper letters, 18 selfloop transitions, 4 changer transitions 0/406 dead transitions. [2022-11-02 20:35:24,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 406 transitions, 914 flow [2022-11-02 20:35:24,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2022-11-02 20:35:24,104 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9544095665171899 [2022-11-02 20:35:24,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1277 transitions. [2022-11-02 20:35:24,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1277 transitions. [2022-11-02 20:35:24,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:24,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1277 transitions. [2022-11-02 20:35:24,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 425.6666666666667) internal successors, (1277), 3 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,113 INFO L175 Difference]: Start difference. First operand has 391 places, 404 transitions, 864 flow. Second operand 3 states and 1277 transitions. [2022-11-02 20:35:24,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 406 transitions, 914 flow [2022-11-02 20:35:24,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 406 transitions, 914 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:24,122 INFO L231 Difference]: Finished difference. Result has 390 places, 404 transitions, 884 flow [2022-11-02 20:35:24,123 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=390, PETRI_TRANSITIONS=404} [2022-11-02 20:35:24,124 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -14 predicate places. [2022-11-02 20:35:24,124 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 404 transitions, 884 flow [2022-11-02 20:35:24,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:24,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:24,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:35:24,125 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:24,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1598952195, now seen corresponding path program 1 times [2022-11-02 20:35:24,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914815851] [2022-11-02 20:35:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:24,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914815851] [2022-11-02 20:35:24,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914815851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:24,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:24,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045078010] [2022-11-02 20:35:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:24,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:24,178 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 446 [2022-11-02 20:35:24,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 404 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:24,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 446 [2022-11-02 20:35:24,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:24,842 INFO L130 PetriNetUnfolder]: 182/2744 cut-off events. [2022-11-02 20:35:24,842 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 20:35:24,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 2744 events. 182/2744 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 25949 event pairs, 8 based on Foata normal form. 0/2352 useless extension candidates. Maximal degree in co-relation 2578. Up to 66 conditions per place. [2022-11-02 20:35:24,905 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 13 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2022-11-02 20:35:24,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 405 transitions, 918 flow [2022-11-02 20:35:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2022-11-02 20:35:24,909 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9626307922272048 [2022-11-02 20:35:24,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1288 transitions. [2022-11-02 20:35:24,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1288 transitions. [2022-11-02 20:35:24,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:24,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1288 transitions. [2022-11-02 20:35:24,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,918 INFO L175 Difference]: Start difference. First operand has 390 places, 404 transitions, 884 flow. Second operand 3 states and 1288 transitions. [2022-11-02 20:35:24,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 405 transitions, 918 flow [2022-11-02 20:35:24,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 405 transitions, 918 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:24,930 INFO L231 Difference]: Finished difference. Result has 391 places, 403 transitions, 886 flow [2022-11-02 20:35:24,931 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=391, PETRI_TRANSITIONS=403} [2022-11-02 20:35:24,931 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -13 predicate places. [2022-11-02 20:35:24,932 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 403 transitions, 886 flow [2022-11-02 20:35:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:24,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:24,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:24,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:35:24,933 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1472178275, now seen corresponding path program 1 times [2022-11-02 20:35:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:24,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387262376] [2022-11-02 20:35:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:24,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:24,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387262376] [2022-11-02 20:35:24,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387262376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:24,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:24,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057198240] [2022-11-02 20:35:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:24,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:24,998 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 446 [2022-11-02 20:35:24,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 403 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:25,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:25,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 446 [2022-11-02 20:35:25,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:25,711 INFO L130 PetriNetUnfolder]: 154/3168 cut-off events. [2022-11-02 20:35:25,711 INFO L131 PetriNetUnfolder]: For 45/49 co-relation queries the response was YES. [2022-11-02 20:35:25,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 3168 events. 154/3168 cut-off events. For 45/49 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 28314 event pairs, 6 based on Foata normal form. 0/2796 useless extension candidates. Maximal degree in co-relation 2965. Up to 114 conditions per place. [2022-11-02 20:35:25,760 INFO L137 encePairwiseOnDemand]: 442/446 looper letters, 17 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-11-02 20:35:25,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 408 transitions, 939 flow [2022-11-02 20:35:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2022-11-02 20:35:25,764 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9641255605381166 [2022-11-02 20:35:25,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1290 transitions. [2022-11-02 20:35:25,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1290 transitions. [2022-11-02 20:35:25,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:25,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1290 transitions. [2022-11-02 20:35:25,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.0) internal successors, (1290), 3 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:25,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:25,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:25,771 INFO L175 Difference]: Start difference. First operand has 391 places, 403 transitions, 886 flow. Second operand 3 states and 1290 transitions. [2022-11-02 20:35:25,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 408 transitions, 939 flow [2022-11-02 20:35:25,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 408 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:25,779 INFO L231 Difference]: Finished difference. Result has 390 places, 403 transitions, 892 flow [2022-11-02 20:35:25,780 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=390, PETRI_TRANSITIONS=403} [2022-11-02 20:35:25,780 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -14 predicate places. [2022-11-02 20:35:25,780 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 403 transitions, 892 flow [2022-11-02 20:35:25,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:25,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:25,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:25,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:35:25,782 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1719116486, now seen corresponding path program 1 times [2022-11-02 20:35:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:25,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032555218] [2022-11-02 20:35:25,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:25,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032555218] [2022-11-02 20:35:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032555218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:25,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442966433] [2022-11-02 20:35:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:25,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:25,826 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 446 [2022-11-02 20:35:25,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 403 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:25,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:25,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 446 [2022-11-02 20:35:25,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:26,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][407], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true]) [2022-11-02 20:35:26,527 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:35:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-02 20:35:26,531 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][407], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true]) [2022-11-02 20:35:26,531 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is not cut-off event [2022-11-02 20:35:26,531 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:26,531 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:26,531 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:26,531 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2022-11-02 20:35:26,539 INFO L130 PetriNetUnfolder]: 146/3311 cut-off events. [2022-11-02 20:35:26,539 INFO L131 PetriNetUnfolder]: For 36/42 co-relation queries the response was YES. [2022-11-02 20:35:26,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3591 conditions, 3311 events. 146/3311 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 30463 event pairs, 6 based on Foata normal form. 1/2926 useless extension candidates. Maximal degree in co-relation 3116. Up to 87 conditions per place. [2022-11-02 20:35:26,592 INFO L137 encePairwiseOnDemand]: 442/446 looper letters, 17 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-11-02 20:35:26,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 408 transitions, 945 flow [2022-11-02 20:35:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:26,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2022-11-02 20:35:26,596 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9641255605381166 [2022-11-02 20:35:26,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1290 transitions. [2022-11-02 20:35:26,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1290 transitions. [2022-11-02 20:35:26,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:26,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1290 transitions. [2022-11-02 20:35:26,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.0) internal successors, (1290), 3 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:26,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:26,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:26,603 INFO L175 Difference]: Start difference. First operand has 390 places, 403 transitions, 892 flow. Second operand 3 states and 1290 transitions. [2022-11-02 20:35:26,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 408 transitions, 945 flow [2022-11-02 20:35:26,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 408 transitions, 945 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:26,611 INFO L231 Difference]: Finished difference. Result has 391 places, 403 transitions, 902 flow [2022-11-02 20:35:26,611 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=391, PETRI_TRANSITIONS=403} [2022-11-02 20:35:26,612 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -13 predicate places. [2022-11-02 20:35:26,612 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 403 transitions, 902 flow [2022-11-02 20:35:26,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:26,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:26,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:26,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:35:26,613 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1433383674, now seen corresponding path program 1 times [2022-11-02 20:35:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933388371] [2022-11-02 20:35:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:26,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:26,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933388371] [2022-11-02 20:35:26,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933388371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:26,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:26,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751751684] [2022-11-02 20:35:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:26,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:26,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:26,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:26,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:26,664 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 446 [2022-11-02 20:35:26,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 403 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:26,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:26,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 446 [2022-11-02 20:35:26,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:27,920 INFO L130 PetriNetUnfolder]: 575/8501 cut-off events. [2022-11-02 20:35:27,920 INFO L131 PetriNetUnfolder]: For 145/163 co-relation queries the response was YES. [2022-11-02 20:35:27,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9476 conditions, 8501 events. 575/8501 cut-off events. For 145/163 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 101541 event pairs, 76 based on Foata normal form. 1/7589 useless extension candidates. Maximal degree in co-relation 8474. Up to 624 conditions per place. [2022-11-02 20:35:28,011 INFO L137 encePairwiseOnDemand]: 438/446 looper letters, 20 selfloop transitions, 4 changer transitions 0/407 dead transitions. [2022-11-02 20:35:28,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 407 transitions, 962 flow [2022-11-02 20:35:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:35:28,015 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9559043348281017 [2022-11-02 20:35:28,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:35:28,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:35:28,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:28,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:35:28,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:28,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:28,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:28,022 INFO L175 Difference]: Start difference. First operand has 391 places, 403 transitions, 902 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:35:28,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 407 transitions, 962 flow [2022-11-02 20:35:28,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 407 transitions, 962 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:28,030 INFO L231 Difference]: Finished difference. Result has 390 places, 403 transitions, 922 flow [2022-11-02 20:35:28,030 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=390, PETRI_TRANSITIONS=403} [2022-11-02 20:35:28,031 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -14 predicate places. [2022-11-02 20:35:28,031 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 403 transitions, 922 flow [2022-11-02 20:35:28,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:28,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:28,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:28,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:35:28,032 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1891706013, now seen corresponding path program 1 times [2022-11-02 20:35:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:28,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238077136] [2022-11-02 20:35:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:28,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238077136] [2022-11-02 20:35:28,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238077136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:28,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:28,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204489741] [2022-11-02 20:35:28,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:28,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:28,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:28,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:28,077 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 446 [2022-11-02 20:35:28,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 403 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 425.6666666666667) internal successors, (1277), 3 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:28,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:28,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 446 [2022-11-02 20:35:28,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:29,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 512#true, Black: 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:29,020 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:35:29,020 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:29,020 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-02 20:35:29,020 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:29,027 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), 509#(= |#race~filename_8~0| 0), Black: 468#true, 512#true, Black: 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:29,027 INFO L383 tUnfolder$Statistics]: this new event has 233 ancestors and is not cut-off event [2022-11-02 20:35:29,027 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:29,027 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2022-11-02 20:35:29,027 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:29,027 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:29,033 INFO L130 PetriNetUnfolder]: 355/6548 cut-off events. [2022-11-02 20:35:29,033 INFO L131 PetriNetUnfolder]: For 67/169 co-relation queries the response was YES. [2022-11-02 20:35:29,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 6548 events. 355/6548 cut-off events. For 67/169 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 72720 event pairs, 44 based on Foata normal form. 7/5862 useless extension candidates. Maximal degree in co-relation 6393. Up to 187 conditions per place. [2022-11-02 20:35:29,110 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 13 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2022-11-02 20:35:29,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 404 transitions, 956 flow [2022-11-02 20:35:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2022-11-02 20:35:29,114 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9626307922272048 [2022-11-02 20:35:29,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1288 transitions. [2022-11-02 20:35:29,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1288 transitions. [2022-11-02 20:35:29,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:29,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1288 transitions. [2022-11-02 20:35:29,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:29,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:29,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:29,120 INFO L175 Difference]: Start difference. First operand has 390 places, 403 transitions, 922 flow. Second operand 3 states and 1288 transitions. [2022-11-02 20:35:29,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 404 transitions, 956 flow [2022-11-02 20:35:29,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 404 transitions, 956 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:29,128 INFO L231 Difference]: Finished difference. Result has 391 places, 402 transitions, 924 flow [2022-11-02 20:35:29,128 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=924, PETRI_PLACES=391, PETRI_TRANSITIONS=402} [2022-11-02 20:35:29,129 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -13 predicate places. [2022-11-02 20:35:29,129 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 402 transitions, 924 flow [2022-11-02 20:35:29,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.6666666666667) internal successors, (1277), 3 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:29,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:29,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:29,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:35:29,130 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:29,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1127238490, now seen corresponding path program 1 times [2022-11-02 20:35:29,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:29,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418942109] [2022-11-02 20:35:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:29,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:29,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418942109] [2022-11-02 20:35:29,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418942109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:29,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:29,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:35:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334659844] [2022-11-02 20:35:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:29,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:35:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:35:29,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:35:29,691 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 446 [2022-11-02 20:35:29,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 402 transitions, 924 flow. Second operand has 6 states, 6 states have (on average 410.0) internal successors, (2460), 6 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:29,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:29,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 446 [2022-11-02 20:35:29,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:30,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 497#true, 329#L80-7true, 475#(= |#race~isNull_3~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 480#(= |#race~filename_2~0| 0), 512#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:30,897 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:35:30,898 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:30,898 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:30,898 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:35:30,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 512#true, Black: 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:30,908 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:35:30,908 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:30,909 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:30,909 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:30,909 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 512#true, Black: 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:30,910 INFO L383 tUnfolder$Statistics]: this new event has 233 ancestors and is cut-off event [2022-11-02 20:35:30,910 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:30,910 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:30,910 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:30,910 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:30,911 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 512#true, Black: 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:30,911 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-02 20:35:30,911 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:30,912 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:30,912 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:30,912 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-02 20:35:30,912 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:30,926 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 512#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:30,926 INFO L383 tUnfolder$Statistics]: this new event has 233 ancestors and is not cut-off event [2022-11-02 20:35:30,926 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:30,927 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:30,927 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:30,927 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2022-11-02 20:35:30,927 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is not cut-off event [2022-11-02 20:35:30,927 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:30,937 INFO L130 PetriNetUnfolder]: 177/3791 cut-off events. [2022-11-02 20:35:30,937 INFO L131 PetriNetUnfolder]: For 5/57 co-relation queries the response was YES. [2022-11-02 20:35:31,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 3791 events. 177/3791 cut-off events. For 5/57 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 36659 event pairs, 0 based on Foata normal form. 20/3395 useless extension candidates. Maximal degree in co-relation 3742. Up to 104 conditions per place. [2022-11-02 20:35:31,041 INFO L137 encePairwiseOnDemand]: 441/446 looper letters, 23 selfloop transitions, 4 changer transitions 0/401 dead transitions. [2022-11-02 20:35:31,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 401 transitions, 976 flow [2022-11-02 20:35:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:35:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:35:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2476 transitions. [2022-11-02 20:35:31,048 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9252615844544095 [2022-11-02 20:35:31,048 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2476 transitions. [2022-11-02 20:35:31,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2476 transitions. [2022-11-02 20:35:31,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:31,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2476 transitions. [2022-11-02 20:35:31,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 412.6666666666667) internal successors, (2476), 6 states have internal predecessors, (2476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:31,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 446.0) internal successors, (3122), 7 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:31,062 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 446.0) internal successors, (3122), 7 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:31,063 INFO L175 Difference]: Start difference. First operand has 391 places, 402 transitions, 924 flow. Second operand 6 states and 2476 transitions. [2022-11-02 20:35:31,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 401 transitions, 976 flow [2022-11-02 20:35:31,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 401 transitions, 972 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:31,073 INFO L231 Difference]: Finished difference. Result has 393 places, 401 transitions, 926 flow [2022-11-02 20:35:31,073 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=393, PETRI_TRANSITIONS=401} [2022-11-02 20:35:31,074 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -11 predicate places. [2022-11-02 20:35:31,074 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 401 transitions, 926 flow [2022-11-02 20:35:31,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.0) internal successors, (2460), 6 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:31,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:31,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:31,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:35:31,076 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash 547817223, now seen corresponding path program 1 times [2022-11-02 20:35:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:31,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893336372] [2022-11-02 20:35:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:31,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:31,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893336372] [2022-11-02 20:35:31,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893336372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:31,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:31,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224709821] [2022-11-02 20:35:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:31,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:31,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:31,137 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 446 [2022-11-02 20:35:31,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 401 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 425.0) internal successors, (1275), 3 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:31,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:31,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 446 [2022-11-02 20:35:31,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:32,471 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [523#true, Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 497#true, 329#L80-7true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:32,471 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:35:32,472 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:35:32,472 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:32,472 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:32,519 INFO L130 PetriNetUnfolder]: 299/6335 cut-off events. [2022-11-02 20:35:32,519 INFO L131 PetriNetUnfolder]: For 93/101 co-relation queries the response was YES. [2022-11-02 20:35:32,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7013 conditions, 6335 events. 299/6335 cut-off events. For 93/101 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 68560 event pairs, 20 based on Foata normal form. 0/5773 useless extension candidates. Maximal degree in co-relation 6571. Up to 304 conditions per place. [2022-11-02 20:35:32,585 INFO L137 encePairwiseOnDemand]: 442/446 looper letters, 16 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2022-11-02 20:35:32,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 405 transitions, 974 flow [2022-11-02 20:35:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2022-11-02 20:35:32,589 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9633781763826607 [2022-11-02 20:35:32,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1289 transitions. [2022-11-02 20:35:32,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1289 transitions. [2022-11-02 20:35:32,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:32,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1289 transitions. [2022-11-02 20:35:32,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:32,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:32,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:32,596 INFO L175 Difference]: Start difference. First operand has 393 places, 401 transitions, 926 flow. Second operand 3 states and 1289 transitions. [2022-11-02 20:35:32,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 405 transitions, 974 flow [2022-11-02 20:35:32,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 405 transitions, 967 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:35:32,605 INFO L231 Difference]: Finished difference. Result has 390 places, 401 transitions, 929 flow [2022-11-02 20:35:32,605 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=929, PETRI_PLACES=390, PETRI_TRANSITIONS=401} [2022-11-02 20:35:32,606 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -14 predicate places. [2022-11-02 20:35:32,606 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 401 transitions, 929 flow [2022-11-02 20:35:32,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.0) internal successors, (1275), 3 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:32,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:32,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:32,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:35:32,607 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash 485446516, now seen corresponding path program 1 times [2022-11-02 20:35:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:32,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011775410] [2022-11-02 20:35:32,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011775410] [2022-11-02 20:35:32,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011775410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:32,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:32,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:32,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702592977] [2022-11-02 20:35:32,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:32,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:32,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:32,654 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 446 [2022-11-02 20:35:32,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 401 transitions, 929 flow. Second operand has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:32,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:32,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 446 [2022-11-02 20:35:32,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:33,675 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1203] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][252], [523#true, Black: 478#true, 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 497#true, 475#(= |#race~isNull_3~0| 0), 282#L56-47true, 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 528#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,675 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-02 20:35:33,676 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-02 20:35:33,676 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 20:35:33,676 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-02 20:35:33,804 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1203] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][252], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 282#L56-47true, 480#(= |#race~filename_2~0| 0), Black: 468#true, 528#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,804 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,804 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,804 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 282#L56-47true, 480#(= |#race~filename_2~0| 0), Black: 468#true, 528#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,840 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,840 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,841 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,841 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), 102#L56-48true, 530#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,845 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-02 20:35:33,845 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:35:33,845 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:33,846 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:35:33,848 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [Black: 478#true, 289#L56-49true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), 530#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,848 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,848 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,848 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:35:33,848 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:35:33,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 155#L58true, Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), 528#true, Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,862 INFO L383 tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event [2022-11-02 20:35:33,862 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,862 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,862 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is cut-off event [2022-11-02 20:35:33,864 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1203] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][252], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 282#L56-47true, 480#(= |#race~filename_2~0| 0), 528#true, Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,864 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,864 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,864 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,864 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,865 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,865 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1203] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][252], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 282#L56-47true, 480#(= |#race~filename_2~0| 0), 528#true, Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,865 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,865 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,865 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,865 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,865 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,866 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,866 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1203] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][252], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 282#L56-47true, 480#(= |#race~filename_2~0| 0), 528#true, Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,866 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-02 20:35:33,866 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,866 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,866 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,867 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,867 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:35:33,867 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:35:33,879 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 282#L56-47true, Black: 468#true, 509#(= |#race~filename_8~0| 0), 480#(= |#race~filename_2~0| 0), 528#true, Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,879 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is not cut-off event [2022-11-02 20:35:33,880 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is not cut-off event [2022-11-02 20:35:33,880 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is not cut-off event [2022-11-02 20:35:33,880 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is not cut-off event [2022-11-02 20:35:33,880 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is not cut-off event [2022-11-02 20:35:33,880 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 102#L56-48true, 490#(= |#race~isNull_6~0| 0), 530#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 480#(= |#race~filename_2~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,880 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-02 20:35:33,881 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:35:33,881 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:33,881 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:33,881 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:35:33,883 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [504#(= |#race~filename_4~0| 0), 289#L56-49true, Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), 530#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 480#(= |#race~filename_2~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,883 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-02 20:35:33,883 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,884 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,884 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:35:33,884 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:35:33,889 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 155#L58true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 468#true, 528#true, 509#(= |#race~filename_8~0| 0), 480#(= |#race~filename_2~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, 204#L79-7true, Black: 507#true]) [2022-11-02 20:35:33,889 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,889 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,889 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is cut-off event [2022-11-02 20:35:33,890 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:33,890 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is cut-off event [2022-11-02 20:35:33,893 INFO L130 PetriNetUnfolder]: 450/5161 cut-off events. [2022-11-02 20:35:33,893 INFO L131 PetriNetUnfolder]: For 280/306 co-relation queries the response was YES. [2022-11-02 20:35:33,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6420 conditions, 5161 events. 450/5161 cut-off events. For 280/306 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 56030 event pairs, 96 based on Foata normal form. 0/4697 useless extension candidates. Maximal degree in co-relation 6295. Up to 453 conditions per place. [2022-11-02 20:35:34,002 INFO L137 encePairwiseOnDemand]: 443/446 looper letters, 12 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2022-11-02 20:35:34,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 402 transitions, 961 flow [2022-11-02 20:35:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2022-11-02 20:35:34,005 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9618834080717489 [2022-11-02 20:35:34,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2022-11-02 20:35:34,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2022-11-02 20:35:34,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:34,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2022-11-02 20:35:34,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:34,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:34,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:34,012 INFO L175 Difference]: Start difference. First operand has 390 places, 401 transitions, 929 flow. Second operand 3 states and 1287 transitions. [2022-11-02 20:35:34,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 402 transitions, 961 flow [2022-11-02 20:35:34,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 402 transitions, 961 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:35:34,020 INFO L231 Difference]: Finished difference. Result has 391 places, 400 transitions, 931 flow [2022-11-02 20:35:34,022 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=931, PETRI_PLACES=391, PETRI_TRANSITIONS=400} [2022-11-02 20:35:34,023 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -13 predicate places. [2022-11-02 20:35:34,023 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 400 transitions, 931 flow [2022-11-02 20:35:34,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:34,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:34,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:34,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:35:34,024 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 558776264, now seen corresponding path program 1 times [2022-11-02 20:35:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:34,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432612564] [2022-11-02 20:35:34,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:34,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432612564] [2022-11-02 20:35:34,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432612564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:34,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:34,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:35:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792139073] [2022-11-02 20:35:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:34,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:35:34,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:34,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:35:34,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:35:34,604 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 446 [2022-11-02 20:35:34,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 400 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 411.0) internal successors, (2466), 6 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:34,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:34,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 446 [2022-11-02 20:35:34,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:35,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [523#true, Black: 478#true, 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 497#true, 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 475#(= |#race~isNull_3~0| 0), 528#true, Black: 468#true, 509#(= |#race~filename_8~0| 0), 480#(= |#race~filename_2~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 502#true, Black: 473#true, Black: 507#true]) [2022-11-02 20:35:35,306 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:35:35,307 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:35:35,307 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:35,307 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:35,323 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 528#true, Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, Black: 507#true]) [2022-11-02 20:35:35,323 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,323 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,323 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:35,324 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,324 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 528#true, 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, Black: 507#true]) [2022-11-02 20:35:35,324 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-02 20:35:35,324 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,324 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,324 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:35,325 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,325 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 528#true, Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, Black: 507#true]) [2022-11-02 20:35:35,325 INFO L383 tUnfolder$Statistics]: this new event has 293 ancestors and is cut-off event [2022-11-02 20:35:35,325 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,325 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,326 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:35,326 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:35,326 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:35,333 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 468#true, 528#true, 509#(= |#race~filename_8~0| 0), 480#(= |#race~filename_2~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 473#true, Black: 507#true]) [2022-11-02 20:35:35,333 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:35:35,333 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:35,333 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:35,334 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:35,334 INFO L386 tUnfolder$Statistics]: existing Event has 293 ancestors and is not cut-off event [2022-11-02 20:35:35,334 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:35,334 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:35,337 INFO L130 PetriNetUnfolder]: 188/4112 cut-off events. [2022-11-02 20:35:35,337 INFO L131 PetriNetUnfolder]: For 5/55 co-relation queries the response was YES. [2022-11-02 20:35:35,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 4112 events. 188/4112 cut-off events. For 5/55 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 40263 event pairs, 0 based on Foata normal form. 8/3788 useless extension candidates. Maximal degree in co-relation 4685. Up to 96 conditions per place. [2022-11-02 20:35:35,396 INFO L137 encePairwiseOnDemand]: 441/446 looper letters, 22 selfloop transitions, 4 changer transitions 0/399 dead transitions. [2022-11-02 20:35:35,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 399 transitions, 981 flow [2022-11-02 20:35:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:35:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:35:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2475 transitions. [2022-11-02 20:35:35,401 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9248878923766816 [2022-11-02 20:35:35,401 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2475 transitions. [2022-11-02 20:35:35,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2475 transitions. [2022-11-02 20:35:35,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:35,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2475 transitions. [2022-11-02 20:35:35,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 412.5) internal successors, (2475), 6 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:35,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 446.0) internal successors, (3122), 7 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:35,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 446.0) internal successors, (3122), 7 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:35,413 INFO L175 Difference]: Start difference. First operand has 391 places, 400 transitions, 931 flow. Second operand 6 states and 2475 transitions. [2022-11-02 20:35:35,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 399 transitions, 981 flow [2022-11-02 20:35:35,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 399 transitions, 977 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:35,424 INFO L231 Difference]: Finished difference. Result has 393 places, 399 transitions, 933 flow [2022-11-02 20:35:35,425 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=393, PETRI_TRANSITIONS=399} [2022-11-02 20:35:35,426 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -11 predicate places. [2022-11-02 20:35:35,426 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 399 transitions, 933 flow [2022-11-02 20:35:35,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 411.0) internal successors, (2466), 6 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:35,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:35,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:35,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:35:35,428 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:35,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 180288860, now seen corresponding path program 1 times [2022-11-02 20:35:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:35,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217533365] [2022-11-02 20:35:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:35,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217533365] [2022-11-02 20:35:35,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217533365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:35,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:35,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453965251] [2022-11-02 20:35:35,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:35,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:35,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:35,510 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 446 [2022-11-02 20:35:35,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 399 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:35,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:35,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 446 [2022-11-02 20:35:35,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:36,938 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][390], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 480#(= |#race~filename_2~0| 0), 509#(= |#race~filename_8~0| 0), Black: 468#true, Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 541#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), Black: 473#true, Black: 507#true]) [2022-11-02 20:35:36,938 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:35:36,939 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:36,939 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:36,939 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:36,943 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][390], [Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 509#(= |#race~filename_8~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, 541#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), Black: 473#true, Black: 507#true]) [2022-11-02 20:35:36,944 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:35:36,944 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:36,944 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:36,944 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:36,944 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:36,945 INFO L130 PetriNetUnfolder]: 407/9083 cut-off events. [2022-11-02 20:35:36,946 INFO L131 PetriNetUnfolder]: For 50/54 co-relation queries the response was YES. [2022-11-02 20:35:37,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10235 conditions, 9083 events. 407/9083 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 107413 event pairs, 16 based on Foata normal form. 0/8443 useless extension candidates. Maximal degree in co-relation 9779. Up to 206 conditions per place. [2022-11-02 20:35:37,054 INFO L137 encePairwiseOnDemand]: 438/446 looper letters, 17 selfloop transitions, 5 changer transitions 0/407 dead transitions. [2022-11-02 20:35:37,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 407 transitions, 998 flow [2022-11-02 20:35:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2022-11-02 20:35:37,057 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9693572496263079 [2022-11-02 20:35:37,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1297 transitions. [2022-11-02 20:35:37,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1297 transitions. [2022-11-02 20:35:37,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:37,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1297 transitions. [2022-11-02 20:35:37,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:37,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:37,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:37,063 INFO L175 Difference]: Start difference. First operand has 393 places, 399 transitions, 933 flow. Second operand 3 states and 1297 transitions. [2022-11-02 20:35:37,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 407 transitions, 998 flow [2022-11-02 20:35:37,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 407 transitions, 991 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:35:37,072 INFO L231 Difference]: Finished difference. Result has 393 places, 402 transitions, 964 flow [2022-11-02 20:35:37,073 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=393, PETRI_TRANSITIONS=402} [2022-11-02 20:35:37,073 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -11 predicate places. [2022-11-02 20:35:37,074 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 402 transitions, 964 flow [2022-11-02 20:35:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:37,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:37,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:35:37,075 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2039737073, now seen corresponding path program 1 times [2022-11-02 20:35:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:37,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017934483] [2022-11-02 20:35:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:37,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:37,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017934483] [2022-11-02 20:35:37,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017934483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:37,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:37,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129005920] [2022-11-02 20:35:37,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:37,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:37,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:37,179 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 446 [2022-11-02 20:35:37,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 402 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:37,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:37,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 446 [2022-11-02 20:35:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:38,228 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][394], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 545#true, 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, 541#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), Black: 473#true, Black: 507#true, Black: 539#true]) [2022-11-02 20:35:38,229 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:35:38,229 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:38,229 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:38,229 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:38,236 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][394], [504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 483#true, 470#(= |#race~isNull_0~0| 0), 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), Black: 523#true, 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 525#(= |#race~filename_7~0| 0), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 545#true, 480#(= |#race~filename_2~0| 0), Black: 468#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, 541#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), Black: 473#true, Black: 539#true, Black: 507#true]) [2022-11-02 20:35:38,237 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:35:38,237 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:38,237 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:38,237 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:38,237 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:38,240 INFO L130 PetriNetUnfolder]: 346/7434 cut-off events. [2022-11-02 20:35:38,240 INFO L131 PetriNetUnfolder]: For 122/142 co-relation queries the response was YES. [2022-11-02 20:35:38,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8419 conditions, 7434 events. 346/7434 cut-off events. For 122/142 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 82601 event pairs, 13 based on Foata normal form. 9/6920 useless extension candidates. Maximal degree in co-relation 7718. Up to 174 conditions per place. [2022-11-02 20:35:38,331 INFO L137 encePairwiseOnDemand]: 440/446 looper letters, 22 selfloop transitions, 3 changer transitions 0/410 dead transitions. [2022-11-02 20:35:38,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 410 transitions, 1041 flow [2022-11-02 20:35:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2022-11-02 20:35:38,336 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9693572496263079 [2022-11-02 20:35:38,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1297 transitions. [2022-11-02 20:35:38,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1297 transitions. [2022-11-02 20:35:38,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:38,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1297 transitions. [2022-11-02 20:35:38,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:38,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:38,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:38,343 INFO L175 Difference]: Start difference. First operand has 393 places, 402 transitions, 964 flow. Second operand 3 states and 1297 transitions. [2022-11-02 20:35:38,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 410 transitions, 1041 flow [2022-11-02 20:35:38,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 410 transitions, 1031 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:38,354 INFO L231 Difference]: Finished difference. Result has 395 places, 405 transitions, 990 flow [2022-11-02 20:35:38,355 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=990, PETRI_PLACES=395, PETRI_TRANSITIONS=405} [2022-11-02 20:35:38,355 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -9 predicate places. [2022-11-02 20:35:38,356 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 405 transitions, 990 flow [2022-11-02 20:35:38,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:38,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:38,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:38,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:35:38,357 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:38,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1265035459, now seen corresponding path program 1 times [2022-11-02 20:35:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:38,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081119819] [2022-11-02 20:35:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:38,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081119819] [2022-11-02 20:35:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081119819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:38,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:38,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:35:38,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129257865] [2022-11-02 20:35:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:38,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:35:38,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:35:38,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:35:38,847 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 446 [2022-11-02 20:35:38,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 405 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:38,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:38,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 446 [2022-11-02 20:35:38,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:39,996 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [523#true, Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), 470#(= |#race~isNull_0~0| 0), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 497#true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 475#(= |#race~isNull_3~0| 0), 545#true, 480#(= |#race~filename_2~0| 0), 509#(= |#race~filename_8~0| 0), Black: 468#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 502#true, Black: 473#true, Black: 539#true, Black: 507#true]) [2022-11-02 20:35:39,997 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:35:39,997 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:39,997 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:35:39,997 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:35:40,031 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 545#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 507#true]) [2022-11-02 20:35:40,031 INFO L383 tUnfolder$Statistics]: this new event has 293 ancestors and is cut-off event [2022-11-02 20:35:40,031 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:40,031 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:40,031 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:40,032 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 475#(= |#race~isNull_3~0| 0), Black: 497#true, 545#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 507#true]) [2022-11-02 20:35:40,032 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-02 20:35:40,032 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:40,032 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:40,032 INFO L386 tUnfolder$Statistics]: existing Event has 293 ancestors and is cut-off event [2022-11-02 20:35:40,032 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:40,032 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 475#(= |#race~isNull_3~0| 0), Black: 497#true, 545#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 507#true]) [2022-11-02 20:35:40,033 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:35:40,033 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:40,033 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:40,033 INFO L386 tUnfolder$Statistics]: existing Event has 293 ancestors and is cut-off event [2022-11-02 20:35:40,033 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:40,033 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:40,040 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 329#L80-7true, 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 545#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 507#true]) [2022-11-02 20:35:40,040 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:35:40,041 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:40,041 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:40,041 INFO L386 tUnfolder$Statistics]: existing Event has 293 ancestors and is not cut-off event [2022-11-02 20:35:40,041 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:40,041 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:40,041 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:40,045 INFO L130 PetriNetUnfolder]: 235/5175 cut-off events. [2022-11-02 20:35:40,045 INFO L131 PetriNetUnfolder]: For 30/102 co-relation queries the response was YES. [2022-11-02 20:35:40,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5889 conditions, 5175 events. 235/5175 cut-off events. For 30/102 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 54553 event pairs, 0 based on Foata normal form. 0/4771 useless extension candidates. Maximal degree in co-relation 5752. Up to 118 conditions per place. [2022-11-02 20:35:40,138 INFO L137 encePairwiseOnDemand]: 441/446 looper letters, 21 selfloop transitions, 4 changer transitions 0/404 dead transitions. [2022-11-02 20:35:40,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 404 transitions, 1038 flow [2022-11-02 20:35:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:35:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:35:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2474 transitions. [2022-11-02 20:35:40,146 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9245142002989537 [2022-11-02 20:35:40,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2474 transitions. [2022-11-02 20:35:40,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2474 transitions. [2022-11-02 20:35:40,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:40,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2474 transitions. [2022-11-02 20:35:40,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 412.3333333333333) internal successors, (2474), 6 states have internal predecessors, (2474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:40,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 446.0) internal successors, (3122), 7 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:40,156 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 446.0) internal successors, (3122), 7 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:40,156 INFO L175 Difference]: Start difference. First operand has 395 places, 405 transitions, 990 flow. Second operand 6 states and 2474 transitions. [2022-11-02 20:35:40,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 404 transitions, 1038 flow [2022-11-02 20:35:40,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 404 transitions, 1029 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:40,167 INFO L231 Difference]: Finished difference. Result has 398 places, 404 transitions, 987 flow [2022-11-02 20:35:40,168 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=987, PETRI_PLACES=398, PETRI_TRANSITIONS=404} [2022-11-02 20:35:40,169 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -6 predicate places. [2022-11-02 20:35:40,169 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 404 transitions, 987 flow [2022-11-02 20:35:40,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:40,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:40,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:40,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:35:40,170 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1670359254, now seen corresponding path program 1 times [2022-11-02 20:35:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:40,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811738271] [2022-11-02 20:35:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:40,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:40,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811738271] [2022-11-02 20:35:40,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811738271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:40,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:40,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595353244] [2022-11-02 20:35:40,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:40,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:40,255 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 446 [2022-11-02 20:35:40,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 404 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:40,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:40,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 446 [2022-11-02 20:35:40,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:41,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 497#true, 475#(= |#race~isNull_3~0| 0), 558#true, 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 507#true]) [2022-11-02 20:35:41,550 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-02 20:35:41,550 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:41,550 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:41,550 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:41,555 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), Black: 473#true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 475#(= |#race~isNull_3~0| 0), Black: 497#true, 558#true, 509#(= |#race~filename_8~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 507#true]) [2022-11-02 20:35:41,555 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:35:41,555 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:41,555 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:41,555 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:41,555 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:41,558 INFO L130 PetriNetUnfolder]: 320/6884 cut-off events. [2022-11-02 20:35:41,558 INFO L131 PetriNetUnfolder]: For 44/80 co-relation queries the response was YES. [2022-11-02 20:35:41,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7826 conditions, 6884 events. 320/6884 cut-off events. For 44/80 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 77161 event pairs, 16 based on Foata normal form. 0/6388 useless extension candidates. Maximal degree in co-relation 7432. Up to 164 conditions per place. [2022-11-02 20:35:41,653 INFO L137 encePairwiseOnDemand]: 444/446 looper letters, 9 selfloop transitions, 1 changer transitions 0/403 dead transitions. [2022-11-02 20:35:41,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 403 transitions, 1005 flow [2022-11-02 20:35:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2022-11-02 20:35:41,656 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9633781763826607 [2022-11-02 20:35:41,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1289 transitions. [2022-11-02 20:35:41,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1289 transitions. [2022-11-02 20:35:41,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:41,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1289 transitions. [2022-11-02 20:35:41,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:41,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:41,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:41,661 INFO L175 Difference]: Start difference. First operand has 398 places, 404 transitions, 987 flow. Second operand 3 states and 1289 transitions. [2022-11-02 20:35:41,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 403 transitions, 1005 flow [2022-11-02 20:35:41,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 403 transitions, 998 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:35:41,670 INFO L231 Difference]: Finished difference. Result has 395 places, 403 transitions, 980 flow [2022-11-02 20:35:41,670 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=395, PETRI_TRANSITIONS=403} [2022-11-02 20:35:41,671 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -9 predicate places. [2022-11-02 20:35:41,671 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 403 transitions, 980 flow [2022-11-02 20:35:41,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:41,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:41,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:41,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:35:41,672 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1643557800, now seen corresponding path program 1 times [2022-11-02 20:35:41,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:41,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675083120] [2022-11-02 20:35:41,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:41,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:41,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675083120] [2022-11-02 20:35:41,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675083120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:41,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:41,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017197524] [2022-11-02 20:35:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:41,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:41,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:41,742 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 446 [2022-11-02 20:35:41,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 403 transitions, 980 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:41,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:41,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 446 [2022-11-02 20:35:41,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:42,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][395], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 475#(= |#race~isNull_3~0| 0), Black: 497#true, 558#true, 509#(= |#race~filename_8~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 562#true, Black: 507#true]) [2022-11-02 20:35:42,941 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][395], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 475#(= |#race~isNull_3~0| 0), Black: 497#true, 558#true, 509#(= |#race~filename_8~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 562#true, Black: 507#true]) [2022-11-02 20:35:42,942 INFO L383 tUnfolder$Statistics]: this new event has 293 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:42,942 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:35:42,948 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1274] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][395], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 525#(= |#race~filename_7~0| 0), 480#(= |#race~filename_2~0| 0), Black: 468#true, Black: 473#true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 329#L80-7true, 556#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 475#(= |#race~isNull_3~0| 0), Black: 497#true, 558#true, 509#(= |#race~filename_8~0| 0), Black: 502#true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 562#true, Black: 507#true]) [2022-11-02 20:35:42,949 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:35:42,949 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:42,949 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:35:42,949 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:42,949 INFO L386 tUnfolder$Statistics]: existing Event has 293 ancestors and is not cut-off event [2022-11-02 20:35:42,949 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:35:42,954 INFO L130 PetriNetUnfolder]: 346/7837 cut-off events. [2022-11-02 20:35:42,954 INFO L131 PetriNetUnfolder]: For 105/133 co-relation queries the response was YES. [2022-11-02 20:35:43,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8918 conditions, 7837 events. 346/7837 cut-off events. For 105/133 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 92024 event pairs, 19 based on Foata normal form. 0/7309 useless extension candidates. Maximal degree in co-relation 8554. Up to 142 conditions per place. [2022-11-02 20:35:43,104 INFO L137 encePairwiseOnDemand]: 442/446 looper letters, 17 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-11-02 20:35:43,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 410 transitions, 1037 flow [2022-11-02 20:35:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-02 20:35:43,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9708520179372198 [2022-11-02 20:35:43,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-02 20:35:43,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-02 20:35:43,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:43,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-02 20:35:43,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:43,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:43,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:43,114 INFO L175 Difference]: Start difference. First operand has 395 places, 403 transitions, 980 flow. Second operand 3 states and 1299 transitions. [2022-11-02 20:35:43,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 410 transitions, 1037 flow [2022-11-02 20:35:43,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 410 transitions, 1036 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:43,124 INFO L231 Difference]: Finished difference. Result has 398 places, 405 transitions, 999 flow [2022-11-02 20:35:43,125 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=999, PETRI_PLACES=398, PETRI_TRANSITIONS=405} [2022-11-02 20:35:43,125 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -6 predicate places. [2022-11-02 20:35:43,126 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 405 transitions, 999 flow [2022-11-02 20:35:43,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:43,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:43,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:43,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:35:43,127 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1392622640, now seen corresponding path program 1 times [2022-11-02 20:35:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:43,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772574995] [2022-11-02 20:35:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:43,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772574995] [2022-11-02 20:35:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772574995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:43,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:43,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311880086] [2022-11-02 20:35:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:43,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:43,191 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 446 [2022-11-02 20:35:43,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 405 transitions, 999 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:43,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:43,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 446 [2022-11-02 20:35:43,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:44,272 INFO L130 PetriNetUnfolder]: 287/7041 cut-off events. [2022-11-02 20:35:44,272 INFO L131 PetriNetUnfolder]: For 127/148 co-relation queries the response was YES. [2022-11-02 20:35:44,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7973 conditions, 7041 events. 287/7041 cut-off events. For 127/148 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 76053 event pairs, 18 based on Foata normal form. 12/6585 useless extension candidates. Maximal degree in co-relation 7225. Up to 156 conditions per place. [2022-11-02 20:35:44,377 INFO L137 encePairwiseOnDemand]: 440/446 looper letters, 17 selfloop transitions, 4 changer transitions 0/412 dead transitions. [2022-11-02 20:35:44,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 412 transitions, 1064 flow [2022-11-02 20:35:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-02 20:35:44,380 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9708520179372198 [2022-11-02 20:35:44,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-02 20:35:44,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-02 20:35:44,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:44,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-02 20:35:44,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:44,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:44,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:44,383 INFO L175 Difference]: Start difference. First operand has 398 places, 405 transitions, 999 flow. Second operand 3 states and 1299 transitions. [2022-11-02 20:35:44,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 412 transitions, 1064 flow [2022-11-02 20:35:44,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 412 transitions, 1062 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:44,394 INFO L231 Difference]: Finished difference. Result has 401 places, 407 transitions, 1029 flow [2022-11-02 20:35:44,395 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=401, PETRI_TRANSITIONS=407} [2022-11-02 20:35:44,396 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -3 predicate places. [2022-11-02 20:35:44,396 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 407 transitions, 1029 flow [2022-11-02 20:35:44,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:44,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:44,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:44,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:35:44,397 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash 579368627, now seen corresponding path program 1 times [2022-11-02 20:35:44,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:44,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157099944] [2022-11-02 20:35:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:44,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157099944] [2022-11-02 20:35:44,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157099944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:44,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:44,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565225647] [2022-11-02 20:35:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:44,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:44,482 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 446 [2022-11-02 20:35:44,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 407 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:44,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:44,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 446 [2022-11-02 20:35:44,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:45,965 INFO L130 PetriNetUnfolder]: 354/9119 cut-off events. [2022-11-02 20:35:45,965 INFO L131 PetriNetUnfolder]: For 126/219 co-relation queries the response was YES. [2022-11-02 20:35:46,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10492 conditions, 9119 events. 354/9119 cut-off events. For 126/219 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 110489 event pairs, 72 based on Foata normal form. 0/8563 useless extension candidates. Maximal degree in co-relation 9161. Up to 233 conditions per place. [2022-11-02 20:35:46,110 INFO L137 encePairwiseOnDemand]: 444/446 looper letters, 9 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2022-11-02 20:35:46,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 406 transitions, 1047 flow [2022-11-02 20:35:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2022-11-02 20:35:46,114 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9633781763826607 [2022-11-02 20:35:46,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1289 transitions. [2022-11-02 20:35:46,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1289 transitions. [2022-11-02 20:35:46,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:46,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1289 transitions. [2022-11-02 20:35:46,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:46,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:46,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:46,120 INFO L175 Difference]: Start difference. First operand has 401 places, 407 transitions, 1029 flow. Second operand 3 states and 1289 transitions. [2022-11-02 20:35:46,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 406 transitions, 1047 flow [2022-11-02 20:35:46,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 406 transitions, 1035 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:46,132 INFO L231 Difference]: Finished difference. Result has 400 places, 406 transitions, 1017 flow [2022-11-02 20:35:46,132 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1017, PETRI_PLACES=400, PETRI_TRANSITIONS=406} [2022-11-02 20:35:46,133 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -4 predicate places. [2022-11-02 20:35:46,133 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 406 transitions, 1017 flow [2022-11-02 20:35:46,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:46,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:46,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:46,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:35:46,135 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-02 20:35:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1037377819, now seen corresponding path program 1 times [2022-11-02 20:35:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:46,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794592224] [2022-11-02 20:35:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794592224] [2022-11-02 20:35:46,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794592224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:46,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:46,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805672216] [2022-11-02 20:35:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:46,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:46,210 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 446 [2022-11-02 20:35:46,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 406 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:46,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:46,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 446 [2022-11-02 20:35:46,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:47,383 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][383], [470#(= |#race~isNull_0~0| 0), 102#L56-48true, Black: 523#true, 574#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 578#true, Black: 473#true, 204#L79-7true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 564#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 568#true, Black: 507#true]) [2022-11-02 20:35:47,383 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-02 20:35:47,384 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,384 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,384 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:35:47,391 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][383], [470#(= |#race~isNull_0~0| 0), 102#L56-48true, Black: 523#true, 574#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 578#true, Black: 473#true, 204#L79-7true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 564#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 568#true, Black: 507#true]) [2022-11-02 20:35:47,391 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,391 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,391 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:35:47,391 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,391 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:35:47,393 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][383], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 574#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 578#true, Black: 473#true, 204#L79-7true, Black: 539#true, 289#L56-49true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 564#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 568#true, Black: 507#true]) [2022-11-02 20:35:47,393 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:35:47,393 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:35:47,393 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:47,393 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:47,402 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1206] L56-47-->L56-48: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet24#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} AuxVars[] AssignedVars[#race~result_11~0][265], [470#(= |#race~isNull_0~0| 0), 102#L56-48true, Black: 523#true, 574#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 578#true, Black: 473#true, 204#L79-7true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 564#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 568#true, Black: 507#true]) [2022-11-02 20:35:47,402 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,402 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:35:47,402 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,402 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,402 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1206] L56-47-->L56-48: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet24#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} AuxVars[] AssignedVars[#race~result_11~0][265], [470#(= |#race~isNull_0~0| 0), 102#L56-48true, Black: 523#true, 574#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 578#true, Black: 473#true, 204#L79-7true, Black: 539#true, Black: 478#true, 504#(= |#race~filename_4~0| 0), 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 564#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 568#true, Black: 507#true]) [2022-11-02 20:35:47,402 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-02 20:35:47,403 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:35:47,403 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,403 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,403 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:35:47,416 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1206] L56-47-->L56-48: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet24#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} AuxVars[] AssignedVars[#race~result_11~0][265], [470#(= |#race~isNull_0~0| 0), 102#L56-48true, Black: 523#true, 574#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 578#true, Black: 473#true, 204#L79-7true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 564#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 568#true, Black: 507#true]) [2022-11-02 20:35:47,417 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is not cut-off event [2022-11-02 20:35:47,417 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is not cut-off event [2022-11-02 20:35:47,417 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is not cut-off event [2022-11-02 20:35:47,417 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is not cut-off event [2022-11-02 20:35:47,417 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is not cut-off event [2022-11-02 20:35:47,418 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is not cut-off event [2022-11-02 20:35:47,418 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1273] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][383], [470#(= |#race~isNull_0~0| 0), Black: 523#true, 574#true, 525#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_2~0| 0), 578#true, Black: 473#true, 204#L79-7true, Black: 539#true, 504#(= |#race~filename_4~0| 0), Black: 478#true, 289#L56-49true, 485#(= |#race~filename_5~0| 0), Black: 547#(not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256)))), Black: 483#true, 490#(= |#race~isNull_6~0| 0), Black: 488#true, 499#(= |#race~filename_1~0| 0), 537#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 497#true, 475#(= |#race~isNull_3~0| 0), Black: 564#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 509#(= |#race~filename_8~0| 0), 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 502#true, Black: 568#true, Black: 507#true]) [2022-11-02 20:35:47,418 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-02 20:35:47,418 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:35:47,418 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:47,419 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:47,419 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:35:47,428 INFO L130 PetriNetUnfolder]: 300/5799 cut-off events. [2022-11-02 20:35:47,428 INFO L131 PetriNetUnfolder]: For 150/179 co-relation queries the response was YES. [2022-11-02 20:35:47,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6896 conditions, 5799 events. 300/5799 cut-off events. For 150/179 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 63508 event pairs, 90 based on Foata normal form. 28/5428 useless extension candidates. Maximal degree in co-relation 6768. Up to 452 conditions per place. [2022-11-02 20:35:47,483 INFO L137 encePairwiseOnDemand]: 444/446 looper letters, 0 selfloop transitions, 0 changer transitions 405/405 dead transitions. [2022-11-02 20:35:47,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 405 transitions, 1033 flow [2022-11-02 20:35:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2022-11-02 20:35:47,488 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9626307922272048 [2022-11-02 20:35:47,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1288 transitions. [2022-11-02 20:35:47,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1288 transitions. [2022-11-02 20:35:47,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:47,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1288 transitions. [2022-11-02 20:35:47,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:47,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:47,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 446.0) internal successors, (1784), 4 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:47,493 INFO L175 Difference]: Start difference. First operand has 400 places, 406 transitions, 1017 flow. Second operand 3 states and 1288 transitions. [2022-11-02 20:35:47,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 405 transitions, 1033 flow [2022-11-02 20:35:47,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 405 transitions, 1032 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:47,499 INFO L231 Difference]: Finished difference. Result has 400 places, 0 transitions, 0 flow [2022-11-02 20:35:47,499 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=446, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=400, PETRI_TRANSITIONS=0} [2022-11-02 20:35:47,500 INFO L287 CegarLoopForPetriNet]: 404 programPoint places, -4 predicate places. [2022-11-02 20:35:47,500 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 0 transitions, 0 flow [2022-11-02 20:35:47,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:47,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2022-11-02 20:35:47,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2022-11-02 20:35:47,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2022-11-02 20:35:47,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2022-11-02 20:35:47,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2022-11-02 20:35:47,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2022-11-02 20:35:47,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2022-11-02 20:35:47,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2022-11-02 20:35:47,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2022-11-02 20:35:47,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2022-11-02 20:35:47,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2022-11-02 20:35:47,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2022-11-02 20:35:47,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2022-11-02 20:35:47,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2022-11-02 20:35:47,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2022-11-02 20:35:47,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2022-11-02 20:35:47,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2022-11-02 20:35:47,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2022-11-02 20:35:47,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2022-11-02 20:35:47,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2022-11-02 20:35:47,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2022-11-02 20:35:47,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2022-11-02 20:35:47,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2022-11-02 20:35:47,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2022-11-02 20:35:47,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2022-11-02 20:35:47,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2022-11-02 20:35:47,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2022-11-02 20:35:47,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2022-11-02 20:35:47,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2022-11-02 20:35:47,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2022-11-02 20:35:47,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2022-11-02 20:35:47,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2022-11-02 20:35:47,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2022-11-02 20:35:47,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2022-11-02 20:35:47,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2022-11-02 20:35:47,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2022-11-02 20:35:47,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2022-11-02 20:35:47,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2022-11-02 20:35:47,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2022-11-02 20:35:47,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2022-11-02 20:35:47,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2022-11-02 20:35:47,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2022-11-02 20:35:47,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2022-11-02 20:35:47,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2022-11-02 20:35:47,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 72 remaining) [2022-11-02 20:35:47,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2022-11-02 20:35:47,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2022-11-02 20:35:47,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2022-11-02 20:35:47,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2022-11-02 20:35:47,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2022-11-02 20:35:47,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2022-11-02 20:35:47,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2022-11-02 20:35:47,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2022-11-02 20:35:47,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2022-11-02 20:35:47,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2022-11-02 20:35:47,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2022-11-02 20:35:47,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2022-11-02 20:35:47,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2022-11-02 20:35:47,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2022-11-02 20:35:47,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2022-11-02 20:35:47,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2022-11-02 20:35:47,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2022-11-02 20:35:47,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2022-11-02 20:35:47,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2022-11-02 20:35:47,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2022-11-02 20:35:47,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2022-11-02 20:35:47,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2022-11-02 20:35:47,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2022-11-02 20:35:47,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2022-11-02 20:35:47,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2022-11-02 20:35:47,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2022-11-02 20:35:47,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2022-11-02 20:35:47,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:35:47,519 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:47,526 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:35:47,526 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:35:47,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:35:47 BasicIcfg [2022-11-02 20:35:47,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:35:47,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:35:47,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:35:47,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:35:47,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:15" (3/4) ... [2022-11-02 20:35:47,537 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:35:47,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:35:47,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:35:47,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:35:47,550 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-02 20:35:47,551 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:35:47,551 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:35:47,551 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:35:47,597 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:35:47,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:35:47,598 INFO L158 Benchmark]: Toolchain (without parser) took 34103.76ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 71.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 225.1MB. Max. memory is 16.1GB. [2022-11-02 20:35:47,598 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 111.1MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:35:47,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.39ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 81.9MB in the end (delta: -11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:35:47,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.68ms. Allocated memory is still 111.1MB. Free memory was 81.9MB in the beginning and 79.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:35:47,599 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 111.1MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:35:47,600 INFO L158 Benchmark]: RCFGBuilder took 1076.98ms. Allocated memory is still 111.1MB. Free memory was 77.2MB in the beginning and 48.9MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-02 20:35:47,600 INFO L158 Benchmark]: TraceAbstraction took 32519.70ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 47.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-02 20:35:47,601 INFO L158 Benchmark]: Witness Printer took 64.57ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:35:47,603 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 111.1MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.39ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 81.9MB in the end (delta: -11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.68ms. Allocated memory is still 111.1MB. Free memory was 81.9MB in the beginning and 79.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 111.1MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1076.98ms. Allocated memory is still 111.1MB. Free memory was 77.2MB in the beginning and 48.9MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32519.70ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 47.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 64.57ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 669 locations, 72 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.2s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 696 IncrementalHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 258 mSDtfsCounter, 696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=29, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3473 NumberOfCodeBlocks, 3473 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3442 ConstructedInterpolants, 0 QuantifiedInterpolants, 4320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:35:47,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1996e8ff-e9a5-4155-b4ec-198fcef79348/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE