./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b5237d83 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_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a --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 908fbcc4d3742ed9abcae99df082df11caf0d6bd4e74389f515555cf6e492354 --- 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-b5237d8 [2022-11-21 16:35:52,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:35:52,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:35:52,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:35:52,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:35:52,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:35:52,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:35:52,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:35:52,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:35:52,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:35:52,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:35:52,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:35:52,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:35:52,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:35:52,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:35:52,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:35:52,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:35:52,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:35:52,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:35:52,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:35:52,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:35:52,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:35:52,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:35:52,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:35:52,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:35:52,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:35:52,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:35:52,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:35:52,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:35:52,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:35:52,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:35:52,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:35:52,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:35:52,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:35:52,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:35:52,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:35:52,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:35:52,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:35:52,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:35:52,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:35:52,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:35:52,878 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-21 16:35:52,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:35:52,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:35:52,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:35:52,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:35:52,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:35:52,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:35:52,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:35:52,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:35:52,925 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:35:52,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:35:52,926 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:35:52,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:35:52,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:35:52,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:35:52,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:35:52,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:35:52,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:35:52,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:35:52,928 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-21 16:35:52,928 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:35:52,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:35:52,928 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:35:52,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:35:52,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:35:52,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:35:52,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:35:52,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:35:52,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:35:52,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:35:52,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:35:52,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:35:52,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:35:52,931 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:35:52,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:35:52,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:35:52,932 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_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/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_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a 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 -> 908fbcc4d3742ed9abcae99df082df11caf0d6bd4e74389f515555cf6e492354 [2022-11-21 16:35:53,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:35:53,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:35:53,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:35:53,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:35:53,259 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:35:53,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2022-11-21 16:35:56,435 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:35:56,712 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:35:56,713 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2022-11-21 16:35:56,719 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/data/b1c69f84a/655ec1dd2c9d417ab500b9f48c560e43/FLAGba275972a [2022-11-21 16:35:56,734 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/data/b1c69f84a/655ec1dd2c9d417ab500b9f48c560e43 [2022-11-21 16:35:56,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:35:56,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:35:56,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:35:56,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:35:56,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:35:56,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:35:56" (1/1) ... [2022-11-21 16:35:56,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e405046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:56, skipping insertion in model container [2022-11-21 16:35:56,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:35:56" (1/1) ... [2022-11-21 16:35:56,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:35:56,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:35:57,027 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3856,3869] [2022-11-21 16:35:57,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:35:57,046 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:35:57,086 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3856,3869] [2022-11-21 16:35:57,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:35:57,109 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:35:57,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57 WrapperNode [2022-11-21 16:35:57,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:35:57,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:35:57,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:35:57,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:35:57,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,202 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 593 [2022-11-21 16:35:57,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:35:57,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:35:57,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:35:57,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:35:57,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,274 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:35:57,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:35:57,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:35:57,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:35:57,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (1/1) ... [2022-11-21 16:35:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:35:57,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:35:57,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:35:57,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:35:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:35:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:35:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:35:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:35:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-21 16:35:57,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-21 16:35:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-21 16:35:57,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-21 16:35:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:35:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:35:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:35:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:35:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:35:57,385 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:35:57,551 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:35:57,561 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:35:58,504 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:35:58,518 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:35:58,518 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:35:58,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:35:58 BoogieIcfgContainer [2022-11-21 16:35:58,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:35:58,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:35:58,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:35:58,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:35:58,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:35:56" (1/3) ... [2022-11-21 16:35:58,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14962086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:35:58, skipping insertion in model container [2022-11-21 16:35:58,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:35:57" (2/3) ... [2022-11-21 16:35:58,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14962086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:35:58, skipping insertion in model container [2022-11-21 16:35:58,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:35:58" (3/3) ... [2022-11-21 16:35:58,530 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2022-11-21 16:35:58,539 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:35:58,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:35:58,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-11-21 16:35:58,551 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:35:58,726 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 16:35:58,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 743 places, 777 transitions, 1570 flow [2022-11-21 16:35:59,211 INFO L130 PetriNetUnfolder]: 41/775 cut-off events. [2022-11-21 16:35:59,211 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:35:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 775 events. 41/775 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2070 event pairs, 0 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 567. Up to 2 conditions per place. [2022-11-21 16:35:59,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 743 places, 777 transitions, 1570 flow [2022-11-21 16:35:59,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 720 places, 752 transitions, 1516 flow [2022-11-21 16:35:59,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:35:59,289 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;@e331ac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:35:59,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2022-11-21 16:35:59,293 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-21 16:35:59,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:35:59,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:35:59,294 INFO L209 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] [2022-11-21 16:35:59,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:35:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:35:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1787891610, now seen corresponding path program 1 times [2022-11-21 16:35:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:35:59,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255566258] [2022-11-21 16:35:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:35:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:35:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:35:59,578 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-21 16:35:59,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:35:59,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255566258] [2022-11-21 16:35:59,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255566258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:35:59,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:35:59,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:35:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045767353] [2022-11-21 16:35:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:35:59,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:35:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:35:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:35:59,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:35:59,650 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-21 16:35:59,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 752 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:35:59,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:35:59,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-21 16:35:59,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:01,799 INFO L130 PetriNetUnfolder]: 616/7316 cut-off events. [2022-11-21 16:36:01,799 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-11-21 16:36:01,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 7316 events. 616/7316 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 62295 event pairs, 255 based on Foata normal form. 172/5837 useless extension candidates. Maximal degree in co-relation 7420. Up to 604 conditions per place. [2022-11-21 16:36:01,952 INFO L137 encePairwiseOnDemand]: 761/777 looper letters, 37 selfloop transitions, 2 changer transitions 2/738 dead transitions. [2022-11-21 16:36:01,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 738 transitions, 1566 flow [2022-11-21 16:36:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2022-11-21 16:36:01,978 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9519519519519519 [2022-11-21 16:36:01,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2022-11-21 16:36:01,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2022-11-21 16:36:01,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:01,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2022-11-21 16:36:01,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 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-21 16:36:02,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:02,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:02,012 INFO L175 Difference]: Start difference. First operand has 720 places, 752 transitions, 1516 flow. Second operand 3 states and 2219 transitions. [2022-11-21 16:36:02,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 738 transitions, 1566 flow [2022-11-21 16:36:02,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 738 transitions, 1558 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:36:02,042 INFO L231 Difference]: Finished difference. Result has 717 places, 736 transitions, 1480 flow [2022-11-21 16:36:02,045 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=717, PETRI_TRANSITIONS=736} [2022-11-21 16:36:02,051 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -3 predicate places. [2022-11-21 16:36:02,051 INFO L495 AbstractCegarLoop]: Abstraction has has 717 places, 736 transitions, 1480 flow [2022-11-21 16:36:02,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:36:02,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:02,053 INFO L209 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] [2022-11-21 16:36:02,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:36:02,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:02,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:02,055 INFO L85 PathProgramCache]: Analyzing trace with hash 761723413, now seen corresponding path program 1 times [2022-11-21 16:36:02,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:02,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316573800] [2022-11-21 16:36:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:02,160 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-21 16:36:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:02,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316573800] [2022-11-21 16:36:02,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316573800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:02,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:02,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858222596] [2022-11-21 16:36:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:02,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:02,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:02,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:02,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-21 16:36:02,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 736 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:36:02,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:02,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-21 16:36:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:04,138 INFO L130 PetriNetUnfolder]: 617/7344 cut-off events. [2022-11-21 16:36:04,138 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-21 16:36:04,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7970 conditions, 7344 events. 617/7344 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 63263 event pairs, 255 based on Foata normal form. 0/5686 useless extension candidates. Maximal degree in co-relation 7931. Up to 603 conditions per place. [2022-11-21 16:36:04,212 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 37 selfloop transitions, 2 changer transitions 0/735 dead transitions. [2022-11-21 16:36:04,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 735 transitions, 1556 flow [2022-11-21 16:36:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2022-11-21 16:36:04,217 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9463749463749463 [2022-11-21 16:36:04,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2022-11-21 16:36:04,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2022-11-21 16:36:04,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:04,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2022-11-21 16:36:04,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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-21 16:36:04,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:04,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:04,232 INFO L175 Difference]: Start difference. First operand has 717 places, 736 transitions, 1480 flow. Second operand 3 states and 2206 transitions. [2022-11-21 16:36:04,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 735 transitions, 1556 flow [2022-11-21 16:36:04,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 735 transitions, 1552 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:04,244 INFO L231 Difference]: Finished difference. Result has 714 places, 735 transitions, 1478 flow [2022-11-21 16:36:04,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=714, PETRI_TRANSITIONS=735} [2022-11-21 16:36:04,247 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -6 predicate places. [2022-11-21 16:36:04,247 INFO L495 AbstractCegarLoop]: Abstraction has has 714 places, 735 transitions, 1478 flow [2022-11-21 16:36:04,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:36:04,249 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:04,249 INFO L209 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] [2022-11-21 16:36:04,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:36:04,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash 11427718, now seen corresponding path program 1 times [2022-11-21 16:36:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:04,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21311116] [2022-11-21 16:36:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:04,296 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-21 16:36:04,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:04,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21311116] [2022-11-21 16:36:04,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21311116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:04,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:04,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:04,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317324119] [2022-11-21 16:36:04,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:04,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:04,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:04,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:04,306 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-21 16:36:04,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 735 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:36:04,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:04,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-21 16:36:04,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:04,796 INFO L130 PetriNetUnfolder]: 86/1563 cut-off events. [2022-11-21 16:36:04,796 INFO L131 PetriNetUnfolder]: For 2/17 co-relation queries the response was YES. [2022-11-21 16:36:04,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1682 conditions, 1563 events. 86/1563 cut-off events. For 2/17 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8243 event pairs, 24 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1636. Up to 87 conditions per place. [2022-11-21 16:36:04,822 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 37 selfloop transitions, 2 changer transitions 0/734 dead transitions. [2022-11-21 16:36:04,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 734 transitions, 1554 flow [2022-11-21 16:36:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2022-11-21 16:36:04,828 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9463749463749463 [2022-11-21 16:36:04,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2022-11-21 16:36:04,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2022-11-21 16:36:04,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:04,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2022-11-21 16:36:04,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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-21 16:36:04,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:04,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:04,843 INFO L175 Difference]: Start difference. First operand has 714 places, 735 transitions, 1478 flow. Second operand 3 states and 2206 transitions. [2022-11-21 16:36:04,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 734 transitions, 1554 flow [2022-11-21 16:36:04,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 734 transitions, 1550 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:04,855 INFO L231 Difference]: Finished difference. Result has 713 places, 734 transitions, 1476 flow [2022-11-21 16:36:04,856 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=713, PETRI_TRANSITIONS=734} [2022-11-21 16:36:04,857 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -7 predicate places. [2022-11-21 16:36:04,857 INFO L495 AbstractCegarLoop]: Abstraction has has 713 places, 734 transitions, 1476 flow [2022-11-21 16:36:04,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:36:04,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:04,859 INFO L209 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-21 16:36:04,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:36:04,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash -847044289, now seen corresponding path program 1 times [2022-11-21 16:36:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061081692] [2022-11-21 16:36:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:04,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:04,969 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-21 16:36:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:04,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061081692] [2022-11-21 16:36:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061081692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:04,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:04,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265811112] [2022-11-21 16:36:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:04,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:04,975 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 777 [2022-11-21 16:36:04,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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-21 16:36:04,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:04,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 777 [2022-11-21 16:36:04,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:05,273 INFO L130 PetriNetUnfolder]: 56/1018 cut-off events. [2022-11-21 16:36:05,273 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:36:05,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 1018 events. 56/1018 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4109 event pairs, 18 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1053. Up to 62 conditions per place. [2022-11-21 16:36:05,298 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 25 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2022-11-21 16:36:05,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1528 flow [2022-11-21 16:36:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2022-11-21 16:36:05,304 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9566709566709567 [2022-11-21 16:36:05,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2022-11-21 16:36:05,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2022-11-21 16:36:05,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:05,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2022-11-21 16:36:05,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 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-21 16:36:05,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:05,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:05,318 INFO L175 Difference]: Start difference. First operand has 713 places, 734 transitions, 1476 flow. Second operand 3 states and 2230 transitions. [2022-11-21 16:36:05,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1528 flow [2022-11-21 16:36:05,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:05,331 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2022-11-21 16:36:05,332 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2022-11-21 16:36:05,333 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -8 predicate places. [2022-11-21 16:36:05,333 INFO L495 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2022-11-21 16:36:05,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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-21 16:36:05,335 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:05,335 INFO L209 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] [2022-11-21 16:36:05,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:36:05,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1522263722, now seen corresponding path program 1 times [2022-11-21 16:36:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:05,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245204561] [2022-11-21 16:36:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:05,379 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-21 16:36:05,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:05,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245204561] [2022-11-21 16:36:05,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245204561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:05,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:05,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557657047] [2022-11-21 16:36:05,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:05,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:05,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:05,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:05,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:05,384 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-21 16:36:05,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 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-21 16:36:05,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:05,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-21 16:36:05,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:05,743 INFO L130 PetriNetUnfolder]: 64/1244 cut-off events. [2022-11-21 16:36:05,743 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-11-21 16:36:05,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1244 events. 64/1244 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4930 event pairs, 15 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 1262. Up to 55 conditions per place. [2022-11-21 16:36:05,775 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 22 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2022-11-21 16:36:05,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1520 flow [2022-11-21 16:36:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2022-11-21 16:36:05,780 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9592449592449592 [2022-11-21 16:36:05,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2236 transitions. [2022-11-21 16:36:05,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2236 transitions. [2022-11-21 16:36:05,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:05,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2236 transitions. [2022-11-21 16:36:05,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 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-21 16:36:05,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:05,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:05,796 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2236 transitions. [2022-11-21 16:36:05,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1520 flow [2022-11-21 16:36:05,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:05,809 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2022-11-21 16:36:05,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2022-11-21 16:36:05,811 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -9 predicate places. [2022-11-21 16:36:05,812 INFO L495 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2022-11-21 16:36:05,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 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-21 16:36:05,814 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:05,814 INFO L209 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] [2022-11-21 16:36:05,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:36:05,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash -636441757, now seen corresponding path program 1 times [2022-11-21 16:36:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:05,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833544880] [2022-11-21 16:36:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:05,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:05,889 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-21 16:36:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:05,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833544880] [2022-11-21 16:36:05,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833544880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:05,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:05,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304077500] [2022-11-21 16:36:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:05,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:05,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:05,894 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 777 [2022-11-21 16:36:05,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 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-21 16:36:05,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:05,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 777 [2022-11-21 16:36:05,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:06,327 INFO L130 PetriNetUnfolder]: 86/1306 cut-off events. [2022-11-21 16:36:06,327 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:36:06,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1306 events. 86/1306 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6409 event pairs, 36 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 1399. Up to 116 conditions per place. [2022-11-21 16:36:06,355 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 43 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2022-11-21 16:36:06,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1560 flow [2022-11-21 16:36:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2194 transitions. [2022-11-21 16:36:06,361 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9412269412269412 [2022-11-21 16:36:06,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2194 transitions. [2022-11-21 16:36:06,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2194 transitions. [2022-11-21 16:36:06,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:06,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2194 transitions. [2022-11-21 16:36:06,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 731.3333333333334) internal successors, (2194), 3 states have internal predecessors, (2194), 0 states have call successors, (0), 0 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-21 16:36:06,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:06,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:06,375 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2194 transitions. [2022-11-21 16:36:06,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1560 flow [2022-11-21 16:36:06,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:06,391 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2022-11-21 16:36:06,392 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2022-11-21 16:36:06,393 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -10 predicate places. [2022-11-21 16:36:06,393 INFO L495 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2022-11-21 16:36:06,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 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-21 16:36:06,395 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:06,395 INFO L209 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] [2022-11-21 16:36:06,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:36:06,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1709122749, now seen corresponding path program 1 times [2022-11-21 16:36:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:06,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522387301] [2022-11-21 16:36:06,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:06,442 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-21 16:36:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:06,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522387301] [2022-11-21 16:36:06,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522387301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:06,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:06,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:06,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044348194] [2022-11-21 16:36:06,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:06,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:06,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-21 16:36:06,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:36:06,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:06,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-21 16:36:06,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:06,818 INFO L130 PetriNetUnfolder]: 62/1003 cut-off events. [2022-11-21 16:36:06,818 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-11-21 16:36:06,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 1003 events. 62/1003 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4973 event pairs, 24 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 1023. Up to 86 conditions per place. [2022-11-21 16:36:06,843 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 36 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2022-11-21 16:36:06,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1544 flow [2022-11-21 16:36:06,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2022-11-21 16:36:06,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-11-21 16:36:06,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2205 transitions. [2022-11-21 16:36:06,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2205 transitions. [2022-11-21 16:36:06,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:06,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2205 transitions. [2022-11-21 16:36:06,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 735.0) internal successors, (2205), 3 states have internal predecessors, (2205), 0 states have call successors, (0), 0 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-21 16:36:06,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:06,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:06,864 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2205 transitions. [2022-11-21 16:36:06,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1544 flow [2022-11-21 16:36:06,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1540 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:06,881 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2022-11-21 16:36:06,882 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2022-11-21 16:36:06,883 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -11 predicate places. [2022-11-21 16:36:06,883 INFO L495 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2022-11-21 16:36:06,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 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-21 16:36:06,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:06,884 INFO L209 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] [2022-11-21 16:36:06,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:36:06,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1778956224, now seen corresponding path program 1 times [2022-11-21 16:36:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:06,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114288027] [2022-11-21 16:36:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:06,983 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-21 16:36:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114288027] [2022-11-21 16:36:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114288027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:06,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:06,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526878919] [2022-11-21 16:36:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:06,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:06,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 777 [2022-11-21 16:36:06,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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-21 16:36:06,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:06,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 777 [2022-11-21 16:36:06,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:07,356 INFO L130 PetriNetUnfolder]: 56/1014 cut-off events. [2022-11-21 16:36:07,356 INFO L131 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES. [2022-11-21 16:36:07,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 1014 events. 56/1014 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4697 event pairs, 18 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 1003. Up to 62 conditions per place. [2022-11-21 16:36:07,382 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 25 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2022-11-21 16:36:07,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1520 flow [2022-11-21 16:36:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2022-11-21 16:36:07,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9566709566709567 [2022-11-21 16:36:07,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2022-11-21 16:36:07,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2022-11-21 16:36:07,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:07,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2022-11-21 16:36:07,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 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-21 16:36:07,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:07,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:07,409 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2022-11-21 16:36:07,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1520 flow [2022-11-21 16:36:07,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:07,427 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2022-11-21 16:36:07,428 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2022-11-21 16:36:07,431 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -12 predicate places. [2022-11-21 16:36:07,431 INFO L495 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2022-11-21 16:36:07,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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-21 16:36:07,432 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:07,433 INFO L209 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] [2022-11-21 16:36:07,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:36:07,433 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:07,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1690013827, now seen corresponding path program 1 times [2022-11-21 16:36:07,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:07,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375707372] [2022-11-21 16:36:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:07,514 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-21 16:36:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:07,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375707372] [2022-11-21 16:36:07,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375707372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:07,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:07,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268375834] [2022-11-21 16:36:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:07,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:07,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:07,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:07,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-21 16:36:07,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 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-21 16:36:07,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:07,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-21 16:36:07,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:07,843 INFO L130 PetriNetUnfolder]: 52/970 cut-off events. [2022-11-21 16:36:07,844 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-11-21 16:36:07,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 970 events. 52/970 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3800 event pairs, 15 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 945. Up to 55 conditions per place. [2022-11-21 16:36:07,866 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 22 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2022-11-21 16:36:07,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1512 flow [2022-11-21 16:36:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2022-11-21 16:36:07,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9592449592449592 [2022-11-21 16:36:07,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2236 transitions. [2022-11-21 16:36:07,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2236 transitions. [2022-11-21 16:36:07,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:07,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2236 transitions. [2022-11-21 16:36:07,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 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-21 16:36:07,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:07,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:07,889 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2236 transitions. [2022-11-21 16:36:07,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1512 flow [2022-11-21 16:36:07,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:07,904 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2022-11-21 16:36:07,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2022-11-21 16:36:07,906 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -13 predicate places. [2022-11-21 16:36:07,906 INFO L495 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2022-11-21 16:36:07,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 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-21 16:36:07,908 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:07,908 INFO L209 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] [2022-11-21 16:36:07,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:36:07,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash -695507324, now seen corresponding path program 1 times [2022-11-21 16:36:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:07,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524712872] [2022-11-21 16:36:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:07,993 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-21 16:36:07,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:07,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524712872] [2022-11-21 16:36:07,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524712872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:07,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:07,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:07,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031163257] [2022-11-21 16:36:07,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:08,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:08,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:08,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:08,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 777 [2022-11-21 16:36:08,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 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-21 16:36:08,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:08,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 777 [2022-11-21 16:36:08,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:08,339 INFO L130 PetriNetUnfolder]: 74/1024 cut-off events. [2022-11-21 16:36:08,340 INFO L131 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2022-11-21 16:36:08,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1024 events. 74/1024 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5558 event pairs, 36 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1053. Up to 116 conditions per place. [2022-11-21 16:36:08,358 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 43 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2022-11-21 16:36:08,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1552 flow [2022-11-21 16:36:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2194 transitions. [2022-11-21 16:36:08,364 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9412269412269412 [2022-11-21 16:36:08,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2194 transitions. [2022-11-21 16:36:08,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2194 transitions. [2022-11-21 16:36:08,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:08,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2194 transitions. [2022-11-21 16:36:08,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 731.3333333333334) internal successors, (2194), 3 states have internal predecessors, (2194), 0 states have call successors, (0), 0 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-21 16:36:08,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:08,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:08,376 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2194 transitions. [2022-11-21 16:36:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1552 flow [2022-11-21 16:36:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1548 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:08,387 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2022-11-21 16:36:08,389 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2022-11-21 16:36:08,389 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -14 predicate places. [2022-11-21 16:36:08,389 INFO L495 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2022-11-21 16:36:08,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 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-21 16:36:08,390 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:08,390 INFO L209 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] [2022-11-21 16:36:08,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:36:08,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 606463638, now seen corresponding path program 1 times [2022-11-21 16:36:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:08,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146276881] [2022-11-21 16:36:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,473 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-21 16:36:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146276881] [2022-11-21 16:36:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146276881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:08,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:08,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432236634] [2022-11-21 16:36:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:08,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:08,477 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 777 [2022-11-21 16:36:08,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 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-21 16:36:08,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:08,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 777 [2022-11-21 16:36:08,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:09,011 INFO L130 PetriNetUnfolder]: 110/2113 cut-off events. [2022-11-21 16:36:09,012 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-21 16:36:09,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 2113 events. 110/2113 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 11108 event pairs, 15 based on Foata normal form. 0/1680 useless extension candidates. Maximal degree in co-relation 2078. Up to 56 conditions per place. [2022-11-21 16:36:09,056 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 13 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2022-11-21 16:36:09,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1490 flow [2022-11-21 16:36:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2022-11-21 16:36:09,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9669669669669669 [2022-11-21 16:36:09,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2254 transitions. [2022-11-21 16:36:09,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2254 transitions. [2022-11-21 16:36:09,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:09,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2254 transitions. [2022-11-21 16:36:09,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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-21 16:36:09,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:09,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:09,075 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2254 transitions. [2022-11-21 16:36:09,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1490 flow [2022-11-21 16:36:09,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1486 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:09,086 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2022-11-21 16:36:09,088 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2022-11-21 16:36:09,088 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -15 predicate places. [2022-11-21 16:36:09,088 INFO L495 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2022-11-21 16:36:09,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 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-21 16:36:09,089 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:09,089 INFO L209 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] [2022-11-21 16:36:09,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:36:09,090 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:09,090 INFO L85 PathProgramCache]: Analyzing trace with hash -495739275, now seen corresponding path program 1 times [2022-11-21 16:36:09,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:09,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545657660] [2022-11-21 16:36:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:09,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:09,573 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-21 16:36:09,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:09,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545657660] [2022-11-21 16:36:09,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545657660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:09,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:09,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:36:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479203808] [2022-11-21 16:36:09,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:09,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:36:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:36:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:09,579 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-21 16:36:09,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 6 states, 6 states have (on average 718.8333333333334) internal successors, (4313), 6 states have internal predecessors, (4313), 0 states have call successors, (0), 0 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-21 16:36:09,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:09,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-21 16:36:09,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:13,321 INFO L130 PetriNetUnfolder]: 1304/15363 cut-off events. [2022-11-21 16:36:13,321 INFO L131 PetriNetUnfolder]: For 14/29 co-relation queries the response was YES. [2022-11-21 16:36:13,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16491 conditions, 15363 events. 1304/15363 cut-off events. For 14/29 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 175049 event pairs, 588 based on Foata normal form. 0/12021 useless extension candidates. Maximal degree in co-relation 16329. Up to 1111 conditions per place. [2022-11-21 16:36:13,551 INFO L137 encePairwiseOnDemand]: 771/777 looper letters, 39 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2022-11-21 16:36:13,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 725 transitions, 1546 flow [2022-11-21 16:36:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:36:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:36:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4347 transitions. [2022-11-21 16:36:13,560 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9324324324324325 [2022-11-21 16:36:13,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4347 transitions. [2022-11-21 16:36:13,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4347 transitions. [2022-11-21 16:36:13,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:13,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4347 transitions. [2022-11-21 16:36:13,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 724.5) internal successors, (4347), 6 states have internal predecessors, (4347), 0 states have call successors, (0), 0 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-21 16:36:13,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 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-21 16:36:13,583 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 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-21 16:36:13,583 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 6 states and 4347 transitions. [2022-11-21 16:36:13,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 725 transitions, 1546 flow [2022-11-21 16:36:13,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 725 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:13,594 INFO L231 Difference]: Finished difference. Result has 707 places, 725 transitions, 1464 flow [2022-11-21 16:36:13,596 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=725} [2022-11-21 16:36:13,596 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -13 predicate places. [2022-11-21 16:36:13,596 INFO L495 AbstractCegarLoop]: Abstraction has has 707 places, 725 transitions, 1464 flow [2022-11-21 16:36:13,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.8333333333334) internal successors, (4313), 6 states have internal predecessors, (4313), 0 states have call successors, (0), 0 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-21 16:36:13,598 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:13,598 INFO L209 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] [2022-11-21 16:36:13,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:36:13,598 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash 448717555, now seen corresponding path program 1 times [2022-11-21 16:36:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:13,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206081474] [2022-11-21 16:36:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:13,654 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-21 16:36:13,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:13,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206081474] [2022-11-21 16:36:13,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206081474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:13,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:13,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946013847] [2022-11-21 16:36:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:13,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:13,664 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 777 [2022-11-21 16:36:13,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 725 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 0 states have call successors, (0), 0 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-21 16:36:13,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:13,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 777 [2022-11-21 16:36:13,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:14,104 INFO L130 PetriNetUnfolder]: 69/1288 cut-off events. [2022-11-21 16:36:14,104 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:36:14,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 1288 events. 69/1288 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6186 event pairs, 2 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1362. Up to 58 conditions per place. [2022-11-21 16:36:14,127 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 24 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2022-11-21 16:36:14,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 725 transitions, 1517 flow [2022-11-21 16:36:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2022-11-21 16:36:14,132 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9575289575289575 [2022-11-21 16:36:14,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2022-11-21 16:36:14,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2022-11-21 16:36:14,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:14,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2022-11-21 16:36:14,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 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-21 16:36:14,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:14,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:14,148 INFO L175 Difference]: Start difference. First operand has 707 places, 725 transitions, 1464 flow. Second operand 3 states and 2232 transitions. [2022-11-21 16:36:14,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 725 transitions, 1517 flow [2022-11-21 16:36:14,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 725 transitions, 1507 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-21 16:36:14,159 INFO L231 Difference]: Finished difference. Result has 703 places, 724 transitions, 1456 flow [2022-11-21 16:36:14,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=703, PETRI_TRANSITIONS=724} [2022-11-21 16:36:14,162 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -17 predicate places. [2022-11-21 16:36:14,162 INFO L495 AbstractCegarLoop]: Abstraction has has 703 places, 724 transitions, 1456 flow [2022-11-21 16:36:14,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 0 states have call successors, (0), 0 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-21 16:36:14,163 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:14,163 INFO L209 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] [2022-11-21 16:36:14,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:36:14,163 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1780934451, now seen corresponding path program 1 times [2022-11-21 16:36:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258471875] [2022-11-21 16:36:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:14,214 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-21 16:36:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:14,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258471875] [2022-11-21 16:36:14,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258471875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:14,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:14,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489240018] [2022-11-21 16:36:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:14,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:14,219 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-21 16:36:14,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 724 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 719.0) internal successors, (2157), 3 states have internal predecessors, (2157), 0 states have call successors, (0), 0 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-21 16:36:14,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:14,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-21 16:36:14,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:14,548 INFO L130 PetriNetUnfolder]: 87/1299 cut-off events. [2022-11-21 16:36:14,549 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:36:14,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 1299 events. 87/1299 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6437 event pairs, 35 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1301. Up to 112 conditions per place. [2022-11-21 16:36:14,576 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 42 selfloop transitions, 2 changer transitions 0/724 dead transitions. [2022-11-21 16:36:14,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 724 transitions, 1545 flow [2022-11-21 16:36:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2196 transitions. [2022-11-21 16:36:14,581 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420849420849421 [2022-11-21 16:36:14,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2196 transitions. [2022-11-21 16:36:14,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2196 transitions. [2022-11-21 16:36:14,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:14,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2196 transitions. [2022-11-21 16:36:14,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 0 states have call successors, (0), 0 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-21 16:36:14,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:14,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:14,592 INFO L175 Difference]: Start difference. First operand has 703 places, 724 transitions, 1456 flow. Second operand 3 states and 2196 transitions. [2022-11-21 16:36:14,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 724 transitions, 1545 flow [2022-11-21 16:36:14,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 724 transitions, 1541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:14,605 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2022-11-21 16:36:14,606 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=702, PETRI_TRANSITIONS=723} [2022-11-21 16:36:14,607 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -18 predicate places. [2022-11-21 16:36:14,607 INFO L495 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2022-11-21 16:36:14,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 719.0) internal successors, (2157), 3 states have internal predecessors, (2157), 0 states have call successors, (0), 0 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-21 16:36:14,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:14,609 INFO L209 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] [2022-11-21 16:36:14,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:36:14,609 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 115297316, now seen corresponding path program 1 times [2022-11-21 16:36:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:14,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456988965] [2022-11-21 16:36:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:14,665 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-21 16:36:14,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:14,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456988965] [2022-11-21 16:36:14,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456988965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:14,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:14,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097000901] [2022-11-21 16:36:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:14,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:14,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:14,670 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 777 [2022-11-21 16:36:14,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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-21 16:36:14,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:14,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 777 [2022-11-21 16:36:14,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:15,007 INFO L130 PetriNetUnfolder]: 57/1016 cut-off events. [2022-11-21 16:36:15,007 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-11-21 16:36:15,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 1016 events. 57/1016 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4752 event pairs, 2 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 922. Up to 58 conditions per place. [2022-11-21 16:36:15,027 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 24 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2022-11-21 16:36:15,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1507 flow [2022-11-21 16:36:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2022-11-21 16:36:15,032 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9575289575289575 [2022-11-21 16:36:15,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2022-11-21 16:36:15,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2022-11-21 16:36:15,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:15,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2022-11-21 16:36:15,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 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-21 16:36:15,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:15,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:15,043 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2232 transitions. [2022-11-21 16:36:15,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1507 flow [2022-11-21 16:36:15,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1503 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:15,055 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2022-11-21 16:36:15,057 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2022-11-21 16:36:15,058 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -19 predicate places. [2022-11-21 16:36:15,059 INFO L495 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2022-11-21 16:36:15,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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-21 16:36:15,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:15,060 INFO L209 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] [2022-11-21 16:36:15,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:36:15,060 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -85471560, now seen corresponding path program 1 times [2022-11-21 16:36:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:15,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312769049] [2022-11-21 16:36:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:15,119 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-21 16:36:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312769049] [2022-11-21 16:36:15,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312769049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:15,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:15,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196543552] [2022-11-21 16:36:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:15,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:15,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:15,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-21 16:36:15,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-21 16:36:15,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:15,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-21 16:36:15,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:16,364 INFO L130 PetriNetUnfolder]: 383/5318 cut-off events. [2022-11-21 16:36:16,364 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-21 16:36:16,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 5318 events. 383/5318 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 41266 event pairs, 100 based on Foata normal form. 0/4243 useless extension candidates. Maximal degree in co-relation 5176. Up to 296 conditions per place. [2022-11-21 16:36:16,425 INFO L137 encePairwiseOnDemand]: 765/777 looper letters, 27 selfloop transitions, 2 changer transitions 0/715 dead transitions. [2022-11-21 16:36:16,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 715 transitions, 1497 flow [2022-11-21 16:36:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2214 transitions. [2022-11-21 16:36:16,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9498069498069498 [2022-11-21 16:36:16,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2214 transitions. [2022-11-21 16:36:16,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2214 transitions. [2022-11-21 16:36:16,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:16,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2214 transitions. [2022-11-21 16:36:16,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.0) internal successors, (2214), 3 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-21 16:36:16,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:16,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:16,444 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2214 transitions. [2022-11-21 16:36:16,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 715 transitions, 1497 flow [2022-11-21 16:36:16,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 715 transitions, 1493 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:16,459 INFO L231 Difference]: Finished difference. Result has 692 places, 714 transitions, 1442 flow [2022-11-21 16:36:16,460 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1442, PETRI_PLACES=692, PETRI_TRANSITIONS=714} [2022-11-21 16:36:16,461 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -28 predicate places. [2022-11-21 16:36:16,461 INFO L495 AbstractCegarLoop]: Abstraction has has 692 places, 714 transitions, 1442 flow [2022-11-21 16:36:16,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-21 16:36:16,462 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:16,462 INFO L209 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] [2022-11-21 16:36:16,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:36:16,463 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash -533733990, now seen corresponding path program 1 times [2022-11-21 16:36:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:16,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010380850] [2022-11-21 16:36:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:16,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:16,521 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-21 16:36:16,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:16,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010380850] [2022-11-21 16:36:16,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010380850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:16,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:16,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:16,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234585596] [2022-11-21 16:36:16,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:16,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:16,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:16,527 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-21 16:36:16,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 714 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-21 16:36:16,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:16,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-21 16:36:16,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:17,811 INFO L130 PetriNetUnfolder]: 398/5510 cut-off events. [2022-11-21 16:36:17,811 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-21 16:36:17,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 5510 events. 398/5510 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43475 event pairs, 100 based on Foata normal form. 0/4462 useless extension candidates. Maximal degree in co-relation 5420. Up to 304 conditions per place. [2022-11-21 16:36:17,842 INFO L137 encePairwiseOnDemand]: 765/777 looper letters, 27 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2022-11-21 16:36:17,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 707 transitions, 1487 flow [2022-11-21 16:36:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2214 transitions. [2022-11-21 16:36:17,846 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9498069498069498 [2022-11-21 16:36:17,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2214 transitions. [2022-11-21 16:36:17,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2214 transitions. [2022-11-21 16:36:17,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:17,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2214 transitions. [2022-11-21 16:36:17,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.0) internal successors, (2214), 3 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-21 16:36:17,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:17,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:17,856 INFO L175 Difference]: Start difference. First operand has 692 places, 714 transitions, 1442 flow. Second operand 3 states and 2214 transitions. [2022-11-21 16:36:17,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 707 transitions, 1487 flow [2022-11-21 16:36:17,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 707 transitions, 1487 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:36:17,868 INFO L231 Difference]: Finished difference. Result has 685 places, 706 transitions, 1436 flow [2022-11-21 16:36:17,869 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=685, PETRI_TRANSITIONS=706} [2022-11-21 16:36:17,869 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -35 predicate places. [2022-11-21 16:36:17,870 INFO L495 AbstractCegarLoop]: Abstraction has has 685 places, 706 transitions, 1436 flow [2022-11-21 16:36:17,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-21 16:36:17,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:17,871 INFO L209 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] [2022-11-21 16:36:17,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:36:17,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1616997212, now seen corresponding path program 1 times [2022-11-21 16:36:17,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:17,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022885524] [2022-11-21 16:36:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:17,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:18,001 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-21 16:36:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:18,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022885524] [2022-11-21 16:36:18,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022885524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:18,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:18,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:36:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120032064] [2022-11-21 16:36:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:18,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:36:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:36:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:36:18,007 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 777 [2022-11-21 16:36:18,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 706 transitions, 1436 flow. Second operand has 5 states, 5 states have (on average 742.0) internal successors, (3710), 5 states have internal predecessors, (3710), 0 states have call successors, (0), 0 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-21 16:36:18,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:18,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 777 [2022-11-21 16:36:18,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:18,319 INFO L130 PetriNetUnfolder]: 52/1209 cut-off events. [2022-11-21 16:36:18,319 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-11-21 16:36:18,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 1209 events. 52/1209 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5380 event pairs, 0 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1031. Up to 19 conditions per place. [2022-11-21 16:36:18,334 INFO L137 encePairwiseOnDemand]: 772/777 looper letters, 26 selfloop transitions, 4 changer transitions 0/715 dead transitions. [2022-11-21 16:36:18,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 715 transitions, 1514 flow [2022-11-21 16:36:18,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:36:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 16:36:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3731 transitions. [2022-11-21 16:36:18,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9603603603603603 [2022-11-21 16:36:18,341 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3731 transitions. [2022-11-21 16:36:18,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3731 transitions. [2022-11-21 16:36:18,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:18,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3731 transitions. [2022-11-21 16:36:18,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 746.2) internal successors, (3731), 5 states have internal predecessors, (3731), 0 states have call successors, (0), 0 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-21 16:36:18,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 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-21 16:36:18,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 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-21 16:36:18,359 INFO L175 Difference]: Start difference. First operand has 685 places, 706 transitions, 1436 flow. Second operand 5 states and 3731 transitions. [2022-11-21 16:36:18,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 715 transitions, 1514 flow [2022-11-21 16:36:18,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 715 transitions, 1514 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:36:18,371 INFO L231 Difference]: Finished difference. Result has 690 places, 707 transitions, 1452 flow [2022-11-21 16:36:18,372 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1452, PETRI_PLACES=690, PETRI_TRANSITIONS=707} [2022-11-21 16:36:18,373 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -30 predicate places. [2022-11-21 16:36:18,373 INFO L495 AbstractCegarLoop]: Abstraction has has 690 places, 707 transitions, 1452 flow [2022-11-21 16:36:18,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 742.0) internal successors, (3710), 5 states have internal predecessors, (3710), 0 states have call successors, (0), 0 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-21 16:36:18,375 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:18,375 INFO L209 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] [2022-11-21 16:36:18,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:36:18,375 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash 126730472, now seen corresponding path program 1 times [2022-11-21 16:36:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:18,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270816353] [2022-11-21 16:36:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:18,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:36:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:18,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270816353] [2022-11-21 16:36:18,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270816353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:36:18,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463719645] [2022-11-21 16:36:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:18,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:36:18,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:36:18,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:36:18,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:36:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:36:18,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:36:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:36:18,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:36:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:36:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463719645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:36:19,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:36:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-21 16:36:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679937344] [2022-11-21 16:36:19,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:36:19,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:36:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:19,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:36:19,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:36:19,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 777 [2022-11-21 16:36:19,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 707 transitions, 1452 flow. Second operand has 14 states, 14 states have (on average 742.5714285714286) internal successors, (10396), 14 states have internal predecessors, (10396), 0 states have call successors, (0), 0 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-21 16:36:19,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:19,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 777 [2022-11-21 16:36:19,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:19,594 INFO L130 PetriNetUnfolder]: 52/1225 cut-off events. [2022-11-21 16:36:19,594 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-11-21 16:36:19,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 1225 events. 52/1225 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5365 event pairs, 0 based on Foata normal form. 2/1032 useless extension candidates. Maximal degree in co-relation 1140. Up to 11 conditions per place. [2022-11-21 16:36:19,613 INFO L137 encePairwiseOnDemand]: 769/777 looper letters, 32 selfloop transitions, 11 changer transitions 0/727 dead transitions. [2022-11-21 16:36:19,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 727 transitions, 1580 flow [2022-11-21 16:36:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:36:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 16:36:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8174 transitions. [2022-11-21 16:36:19,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9563589563589564 [2022-11-21 16:36:19,624 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8174 transitions. [2022-11-21 16:36:19,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8174 transitions. [2022-11-21 16:36:19,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:19,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8174 transitions. [2022-11-21 16:36:19,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 743.0909090909091) internal successors, (8174), 11 states have internal predecessors, (8174), 0 states have call successors, (0), 0 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-21 16:36:19,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 777.0) internal successors, (9324), 12 states have internal predecessors, (9324), 0 states have call successors, (0), 0 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-21 16:36:19,649 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 777.0) internal successors, (9324), 12 states have internal predecessors, (9324), 0 states have call successors, (0), 0 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-21 16:36:19,649 INFO L175 Difference]: Start difference. First operand has 690 places, 707 transitions, 1452 flow. Second operand 11 states and 8174 transitions. [2022-11-21 16:36:19,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 727 transitions, 1580 flow [2022-11-21 16:36:19,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 727 transitions, 1574 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 16:36:19,661 INFO L231 Difference]: Finished difference. Result has 700 places, 713 transitions, 1501 flow [2022-11-21 16:36:19,662 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1501, PETRI_PLACES=700, PETRI_TRANSITIONS=713} [2022-11-21 16:36:19,663 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -20 predicate places. [2022-11-21 16:36:19,663 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 713 transitions, 1501 flow [2022-11-21 16:36:19,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 742.5714285714286) internal successors, (10396), 14 states have internal predecessors, (10396), 0 states have call successors, (0), 0 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-21 16:36:19,665 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:19,666 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:19,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:36:19,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a16d5a8-e375-403f-a3ae-48cd9456ed79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:36:19,876 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -441056144, now seen corresponding path program 2 times [2022-11-21 16:36:19,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:19,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530757538] [2022-11-21 16:36:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:20,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530757538] [2022-11-21 16:36:20,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530757538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:20,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:20,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:36:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794946324] [2022-11-21 16:36:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:20,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:36:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:20,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:36:20,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:20,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-21 16:36:20,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 713 transitions, 1501 flow. Second operand has 6 states, 6 states have (on average 724.6666666666666) internal successors, (4348), 6 states have internal predecessors, (4348), 0 states have call successors, (0), 0 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-21 16:36:20,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:20,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-21 16:36:20,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:23,454 INFO L130 PetriNetUnfolder]: 1261/12147 cut-off events. [2022-11-21 16:36:23,454 INFO L131 PetriNetUnfolder]: For 15/77 co-relation queries the response was YES. [2022-11-21 16:36:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13491 conditions, 12147 events. 1261/12147 cut-off events. For 15/77 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 126651 event pairs, 210 based on Foata normal form. 16/9866 useless extension candidates. Maximal degree in co-relation 13281. Up to 453 conditions per place. [2022-11-21 16:36:23,675 INFO L137 encePairwiseOnDemand]: 772/777 looper letters, 80 selfloop transitions, 4 changer transitions 0/760 dead transitions. [2022-11-21 16:36:23,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 760 transitions, 1763 flow [2022-11-21 16:36:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:36:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:36:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4417 transitions. [2022-11-21 16:36:23,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9474474474474475 [2022-11-21 16:36:23,690 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4417 transitions. [2022-11-21 16:36:23,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4417 transitions. [2022-11-21 16:36:23,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:23,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4417 transitions. [2022-11-21 16:36:23,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 736.1666666666666) internal successors, (4417), 6 states have internal predecessors, (4417), 0 states have call successors, (0), 0 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-21 16:36:23,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 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-21 16:36:23,710 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 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-21 16:36:23,710 INFO L175 Difference]: Start difference. First operand has 700 places, 713 transitions, 1501 flow. Second operand 6 states and 4417 transitions. [2022-11-21 16:36:23,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 760 transitions, 1763 flow [2022-11-21 16:36:23,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 760 transitions, 1754 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-21 16:36:23,728 INFO L231 Difference]: Finished difference. Result has 701 places, 712 transitions, 1498 flow [2022-11-21 16:36:23,729 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1498, PETRI_PLACES=701, PETRI_TRANSITIONS=712} [2022-11-21 16:36:23,729 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -19 predicate places. [2022-11-21 16:36:23,729 INFO L495 AbstractCegarLoop]: Abstraction has has 701 places, 712 transitions, 1498 flow [2022-11-21 16:36:23,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 724.6666666666666) internal successors, (4348), 6 states have internal predecessors, (4348), 0 states have call successors, (0), 0 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-21 16:36:23,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:23,731 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:23,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:36:23,732 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1251748994, now seen corresponding path program 1 times [2022-11-21 16:36:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:23,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928953302] [2022-11-21 16:36:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:23,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928953302] [2022-11-21 16:36:23,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928953302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:23,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:23,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176063342] [2022-11-21 16:36:23,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:23,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:23,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-21 16:36:23,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 712 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 719.3333333333334) internal successors, (2158), 3 states have internal predecessors, (2158), 0 states have call successors, (0), 0 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-21 16:36:23,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:23,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-21 16:36:23,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:24,266 INFO L130 PetriNetUnfolder]: 101/1519 cut-off events. [2022-11-21 16:36:24,266 INFO L131 PetriNetUnfolder]: For 43/44 co-relation queries the response was YES. [2022-11-21 16:36:24,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 1519 events. 101/1519 cut-off events. For 43/44 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9093 event pairs, 2 based on Foata normal form. 0/1263 useless extension candidates. Maximal degree in co-relation 1564. Up to 178 conditions per place. [2022-11-21 16:36:24,284 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 42 selfloop transitions, 2 changer transitions 0/712 dead transitions. [2022-11-21 16:36:24,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 712 transitions, 1587 flow [2022-11-21 16:36:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2196 transitions. [2022-11-21 16:36:24,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420849420849421 [2022-11-21 16:36:24,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2196 transitions. [2022-11-21 16:36:24,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2196 transitions. [2022-11-21 16:36:24,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:24,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2196 transitions. [2022-11-21 16:36:24,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 0 states have call successors, (0), 0 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-21 16:36:24,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:24,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:24,300 INFO L175 Difference]: Start difference. First operand has 701 places, 712 transitions, 1498 flow. Second operand 3 states and 2196 transitions. [2022-11-21 16:36:24,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 712 transitions, 1587 flow [2022-11-21 16:36:24,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 698 places, 712 transitions, 1580 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:36:24,316 INFO L231 Difference]: Finished difference. Result has 698 places, 711 transitions, 1493 flow [2022-11-21 16:36:24,317 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=698, PETRI_TRANSITIONS=711} [2022-11-21 16:36:24,317 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -22 predicate places. [2022-11-21 16:36:24,318 INFO L495 AbstractCegarLoop]: Abstraction has has 698 places, 711 transitions, 1493 flow [2022-11-21 16:36:24,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 719.3333333333334) internal successors, (2158), 3 states have internal predecessors, (2158), 0 states have call successors, (0), 0 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-21 16:36:24,318 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:24,319 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:24,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 16:36:24,319 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2086484312, now seen corresponding path program 1 times [2022-11-21 16:36:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:24,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003375343] [2022-11-21 16:36:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:24,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003375343] [2022-11-21 16:36:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003375343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:24,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:24,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:24,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134366877] [2022-11-21 16:36:24,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:24,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:24,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:24,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:24,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:24,408 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-21 16:36:24,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 711 transitions, 1493 flow. Second operand has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-21 16:36:24,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:24,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-21 16:36:24,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:25,006 INFO L130 PetriNetUnfolder]: 96/1760 cut-off events. [2022-11-21 16:36:25,007 INFO L131 PetriNetUnfolder]: For 6/19 co-relation queries the response was YES. [2022-11-21 16:36:25,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 1760 events. 96/1760 cut-off events. For 6/19 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9926 event pairs, 12 based on Foata normal form. 1/1483 useless extension candidates. Maximal degree in co-relation 1722. Up to 51 conditions per place. [2022-11-21 16:36:25,026 INFO L137 encePairwiseOnDemand]: 762/777 looper letters, 26 selfloop transitions, 9 changer transitions 0/710 dead transitions. [2022-11-21 16:36:25,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 710 transitions, 1562 flow [2022-11-21 16:36:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2216 transitions. [2022-11-21 16:36:25,031 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9506649506649507 [2022-11-21 16:36:25,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2216 transitions. [2022-11-21 16:36:25,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2216 transitions. [2022-11-21 16:36:25,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:25,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2216 transitions. [2022-11-21 16:36:25,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.6666666666666) internal successors, (2216), 3 states have internal predecessors, (2216), 0 states have call successors, (0), 0 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-21 16:36:25,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:25,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:25,040 INFO L175 Difference]: Start difference. First operand has 698 places, 711 transitions, 1493 flow. Second operand 3 states and 2216 transitions. [2022-11-21 16:36:25,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 710 transitions, 1562 flow [2022-11-21 16:36:25,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 710 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:25,056 INFO L231 Difference]: Finished difference. Result has 693 places, 709 transitions, 1520 flow [2022-11-21 16:36:25,057 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1520, PETRI_PLACES=693, PETRI_TRANSITIONS=709} [2022-11-21 16:36:25,058 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -27 predicate places. [2022-11-21 16:36:25,058 INFO L495 AbstractCegarLoop]: Abstraction has has 693 places, 709 transitions, 1520 flow [2022-11-21 16:36:25,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-21 16:36:25,059 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:25,059 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:25,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 16:36:25,060 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1715278707, now seen corresponding path program 1 times [2022-11-21 16:36:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:25,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206993709] [2022-11-21 16:36:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:25,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206993709] [2022-11-21 16:36:25,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206993709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:25,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:25,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973301596] [2022-11-21 16:36:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:25,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 777 [2022-11-21 16:36:25,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 709 transitions, 1520 flow. Second operand has 3 states, 3 states have (on average 725.0) internal successors, (2175), 3 states have internal predecessors, (2175), 0 states have call successors, (0), 0 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-21 16:36:25,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:25,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 777 [2022-11-21 16:36:25,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:25,700 INFO L130 PetriNetUnfolder]: 110/2026 cut-off events. [2022-11-21 16:36:25,700 INFO L131 PetriNetUnfolder]: For 46/60 co-relation queries the response was YES. [2022-11-21 16:36:25,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 2026 events. 110/2026 cut-off events. For 46/60 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 12279 event pairs, 20 based on Foata normal form. 1/1704 useless extension candidates. Maximal degree in co-relation 2028. Up to 77 conditions per place. [2022-11-21 16:36:25,726 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 33 selfloop transitions, 3 changer transitions 0/709 dead transitions. [2022-11-21 16:36:25,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 709 transitions, 1593 flow [2022-11-21 16:36:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2202 transitions. [2022-11-21 16:36:25,732 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446589446589446 [2022-11-21 16:36:25,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2202 transitions. [2022-11-21 16:36:25,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2202 transitions. [2022-11-21 16:36:25,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:25,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2202 transitions. [2022-11-21 16:36:25,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 734.0) internal successors, (2202), 3 states have internal predecessors, (2202), 0 states have call successors, (0), 0 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-21 16:36:25,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:25,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:25,742 INFO L175 Difference]: Start difference. First operand has 693 places, 709 transitions, 1520 flow. Second operand 3 states and 2202 transitions. [2022-11-21 16:36:25,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 709 transitions, 1593 flow [2022-11-21 16:36:25,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 709 transitions, 1584 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:36:25,758 INFO L231 Difference]: Finished difference. Result has 693 places, 708 transitions, 1515 flow [2022-11-21 16:36:25,759 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1515, PETRI_PLACES=693, PETRI_TRANSITIONS=708} [2022-11-21 16:36:25,760 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -27 predicate places. [2022-11-21 16:36:25,760 INFO L495 AbstractCegarLoop]: Abstraction has has 693 places, 708 transitions, 1515 flow [2022-11-21 16:36:25,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.0) internal successors, (2175), 3 states have internal predecessors, (2175), 0 states have call successors, (0), 0 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-21 16:36:25,761 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:25,761 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:25,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 16:36:25,762 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1120038487, now seen corresponding path program 1 times [2022-11-21 16:36:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:25,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064856107] [2022-11-21 16:36:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:25,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064856107] [2022-11-21 16:36:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064856107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:25,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340150810] [2022-11-21 16:36:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:25,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:25,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:25,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:25,851 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-21 16:36:25,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 708 transitions, 1515 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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-21 16:36:25,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:25,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-21 16:36:25,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:26,340 INFO L130 PetriNetUnfolder]: 84/1548 cut-off events. [2022-11-21 16:36:26,340 INFO L131 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2022-11-21 16:36:26,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1738 conditions, 1548 events. 84/1548 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8781 event pairs, 13 based on Foata normal form. 1/1326 useless extension candidates. Maximal degree in co-relation 1546. Up to 83 conditions per place. [2022-11-21 16:36:26,358 INFO L137 encePairwiseOnDemand]: 762/777 looper letters, 22 selfloop transitions, 8 changer transitions 14/707 dead transitions. [2022-11-21 16:36:26,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 707 transitions, 1582 flow [2022-11-21 16:36:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2022-11-21 16:36:26,363 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9502359502359502 [2022-11-21 16:36:26,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2215 transitions. [2022-11-21 16:36:26,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2215 transitions. [2022-11-21 16:36:26,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:26,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2215 transitions. [2022-11-21 16:36:26,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 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-21 16:36:26,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:26,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:26,374 INFO L175 Difference]: Start difference. First operand has 693 places, 708 transitions, 1515 flow. Second operand 3 states and 2215 transitions. [2022-11-21 16:36:26,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 707 transitions, 1582 flow [2022-11-21 16:36:26,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 707 transitions, 1576 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:26,388 INFO L231 Difference]: Finished difference. Result has 688 places, 692 transitions, 1506 flow [2022-11-21 16:36:26,389 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1506, PETRI_PLACES=688, PETRI_TRANSITIONS=692} [2022-11-21 16:36:26,390 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -32 predicate places. [2022-11-21 16:36:26,390 INFO L495 AbstractCegarLoop]: Abstraction has has 688 places, 692 transitions, 1506 flow [2022-11-21 16:36:26,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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-21 16:36:26,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:26,391 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:26,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 16:36:26,392 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 506780862, now seen corresponding path program 1 times [2022-11-21 16:36:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:26,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581822942] [2022-11-21 16:36:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:26,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581822942] [2022-11-21 16:36:26,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581822942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:26,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:26,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853192994] [2022-11-21 16:36:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:26,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:26,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:26,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:26,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 777 [2022-11-21 16:36:26,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 692 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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-21 16:36:26,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:26,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 777 [2022-11-21 16:36:26,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:26,831 INFO L130 PetriNetUnfolder]: 85/1509 cut-off events. [2022-11-21 16:36:26,831 INFO L131 PetriNetUnfolder]: For 99/100 co-relation queries the response was YES. [2022-11-21 16:36:26,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 1509 events. 85/1509 cut-off events. For 99/100 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8521 event pairs, 5 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1573. Up to 118 conditions per place. [2022-11-21 16:36:26,847 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 28 selfloop transitions, 3 changer transitions 0/692 dead transitions. [2022-11-21 16:36:26,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 692 transitions, 1569 flow [2022-11-21 16:36:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2197 transitions. [2022-11-21 16:36:26,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9425139425139425 [2022-11-21 16:36:26,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2197 transitions. [2022-11-21 16:36:26,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2197 transitions. [2022-11-21 16:36:26,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:26,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2197 transitions. [2022-11-21 16:36:26,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 0 states have call successors, (0), 0 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-21 16:36:26,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:26,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:26,857 INFO L175 Difference]: Start difference. First operand has 688 places, 692 transitions, 1506 flow. Second operand 3 states and 2197 transitions. [2022-11-21 16:36:26,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 692 transitions, 1569 flow [2022-11-21 16:36:26,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 692 transitions, 1561 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:36:26,867 INFO L231 Difference]: Finished difference. Result has 675 places, 691 transitions, 1502 flow [2022-11-21 16:36:26,868 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=675, PETRI_TRANSITIONS=691} [2022-11-21 16:36:26,868 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -45 predicate places. [2022-11-21 16:36:26,869 INFO L495 AbstractCegarLoop]: Abstraction has has 675 places, 691 transitions, 1502 flow [2022-11-21 16:36:26,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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-21 16:36:26,869 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:26,870 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:26,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 16:36:26,870 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:26,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash 145275696, now seen corresponding path program 1 times [2022-11-21 16:36:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:26,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725794151] [2022-11-21 16:36:26,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:26,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:26,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725794151] [2022-11-21 16:36:26,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725794151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:26,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:26,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:36:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171267771] [2022-11-21 16:36:26,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:26,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:26,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:26,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:26,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 777 [2022-11-21 16:36:26,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 691 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 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-21 16:36:26,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:26,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 777 [2022-11-21 16:36:26,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:28,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,560 INFO L383 tUnfolder$Statistics]: this new event has 355 ancestors and is cut-off event [2022-11-21 16:36:28,560 INFO L386 tUnfolder$Statistics]: existing Event has 262 ancestors and is cut-off event [2022-11-21 16:36:28,560 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-21 16:36:28,560 INFO L386 tUnfolder$Statistics]: existing Event has 355 ancestors and is cut-off event [2022-11-21 16:36:28,619 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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)), 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,619 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-21 16:36:28,619 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:36:28,619 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-21 16:36:28,619 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:36:28,660 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,660 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:36:28,660 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:28,660 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:36:28,660 INFO L386 tUnfolder$Statistics]: existing Event has 367 ancestors and is cut-off event [2022-11-21 16:36:28,660 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,660 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:36:28,661 INFO L386 tUnfolder$Statistics]: existing Event has 367 ancestors and is cut-off event [2022-11-21 16:36:28,661 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:28,661 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:36:28,805 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 237#L63-9true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,806 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-21 16:36:28,806 INFO L386 tUnfolder$Statistics]: existing Event has 291 ancestors and is cut-off event [2022-11-21 16:36:28,806 INFO L386 tUnfolder$Statistics]: existing Event has 295 ancestors and is cut-off event [2022-11-21 16:36:28,806 INFO L386 tUnfolder$Statistics]: existing Event has 384 ancestors and is cut-off event [2022-11-21 16:36:28,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,863 INFO L383 tUnfolder$Statistics]: this new event has 399 ancestors and is cut-off event [2022-11-21 16:36:28,863 INFO L386 tUnfolder$Statistics]: existing Event has 399 ancestors and is cut-off event [2022-11-21 16:36:28,863 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-21 16:36:28,863 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-21 16:36:28,911 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,911 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,911 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-21 16:36:28,911 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-21 16:36:28,911 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,911 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [523#L77-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,912 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,912 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-21 16:36:28,912 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-21 16:36:28,912 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,913 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,913 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,913 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-21 16:36:28,914 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-21 16:36:28,914 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 543#L56-7true, Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,914 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,914 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-21 16:36:28,914 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-21 16:36:28,914 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-21 16:36:28,985 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,986 INFO L383 tUnfolder$Statistics]: this new event has 411 ancestors and is cut-off event [2022-11-21 16:36:28,986 INFO L386 tUnfolder$Statistics]: existing Event has 318 ancestors and is cut-off event [2022-11-21 16:36:28,986 INFO L386 tUnfolder$Statistics]: existing Event has 411 ancestors and is cut-off event [2022-11-21 16:36:28,986 INFO L386 tUnfolder$Statistics]: existing Event has 322 ancestors and is cut-off event [2022-11-21 16:36:28,987 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [523#L77-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:28,987 INFO L383 tUnfolder$Statistics]: this new event has 411 ancestors and is cut-off event [2022-11-21 16:36:28,987 INFO L386 tUnfolder$Statistics]: existing Event has 318 ancestors and is cut-off event [2022-11-21 16:36:28,987 INFO L386 tUnfolder$Statistics]: existing Event has 322 ancestors and is cut-off event [2022-11-21 16:36:28,987 INFO L386 tUnfolder$Statistics]: existing Event has 411 ancestors and is cut-off event [2022-11-21 16:36:29,026 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,026 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,026 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-21 16:36:29,026 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:36:29,026 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,027 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,027 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,027 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-21 16:36:29,027 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:36:29,027 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,028 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,028 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-21 16:36:29,028 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,028 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:36:29,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,028 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,028 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-21 16:36:29,028 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,029 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:36:29,029 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [523#L77-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,029 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,030 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:36:29,030 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-21 16:36:29,030 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,030 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [523#L77-7true, 543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,030 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,030 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:36:29,030 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-21 16:36:29,030 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-21 16:36:29,079 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,079 INFO L383 tUnfolder$Statistics]: this new event has 423 ancestors and is cut-off event [2022-11-21 16:36:29,079 INFO L386 tUnfolder$Statistics]: existing Event has 334 ancestors and is cut-off event [2022-11-21 16:36:29,079 INFO L386 tUnfolder$Statistics]: existing Event has 330 ancestors and is cut-off event [2022-11-21 16:36:29,079 INFO L386 tUnfolder$Statistics]: existing Event has 423 ancestors and is cut-off event [2022-11-21 16:36:29,080 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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)), 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,080 INFO L383 tUnfolder$Statistics]: this new event has 423 ancestors and is cut-off event [2022-11-21 16:36:29,080 INFO L386 tUnfolder$Statistics]: existing Event has 334 ancestors and is cut-off event [2022-11-21 16:36:29,080 INFO L386 tUnfolder$Statistics]: existing Event has 330 ancestors and is cut-off event [2022-11-21 16:36:29,080 INFO L386 tUnfolder$Statistics]: existing Event has 423 ancestors and is cut-off event [2022-11-21 16:36:29,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,108 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,108 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-21 16:36:29,109 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-21 16:36:29,109 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,109 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,109 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-21 16:36:29,109 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-21 16:36:29,109 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,110 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,110 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-21 16:36:29,110 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-21 16:36:29,110 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:29,110 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,110 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-21 16:36:29,111 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-21 16:36:29,111 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-21 16:36:29,251 INFO L130 PetriNetUnfolder]: 755/10486 cut-off events. [2022-11-21 16:36:29,251 INFO L131 PetriNetUnfolder]: For 78/79 co-relation queries the response was YES. [2022-11-21 16:36:29,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11690 conditions, 10486 events. 755/10486 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 102899 event pairs, 130 based on Foata normal form. 0/8654 useless extension candidates. Maximal degree in co-relation 11495. Up to 415 conditions per place. [2022-11-21 16:36:29,395 INFO L137 encePairwiseOnDemand]: 769/777 looper letters, 45 selfloop transitions, 4 changer transitions 0/711 dead transitions. [2022-11-21 16:36:29,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 711 transitions, 1642 flow [2022-11-21 16:36:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2022-11-21 16:36:29,398 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9648219648219648 [2022-11-21 16:36:29,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2249 transitions. [2022-11-21 16:36:29,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2249 transitions. [2022-11-21 16:36:29,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:29,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2249 transitions. [2022-11-21 16:36:29,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 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-21 16:36:29,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:29,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:29,402 INFO L175 Difference]: Start difference. First operand has 675 places, 691 transitions, 1502 flow. Second operand 3 states and 2249 transitions. [2022-11-21 16:36:29,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 711 transitions, 1642 flow [2022-11-21 16:36:29,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 711 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:29,410 INFO L231 Difference]: Finished difference. Result has 677 places, 695 transitions, 1536 flow [2022-11-21 16:36:29,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=677, PETRI_TRANSITIONS=695} [2022-11-21 16:36:29,412 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -43 predicate places. [2022-11-21 16:36:29,412 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 695 transitions, 1536 flow [2022-11-21 16:36:29,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 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-21 16:36:29,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:29,413 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:29,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 16:36:29,413 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash -697739698, now seen corresponding path program 1 times [2022-11-21 16:36:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:29,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471395851] [2022-11-21 16:36:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:29,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:29,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471395851] [2022-11-21 16:36:29,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471395851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:29,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:29,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084265878] [2022-11-21 16:36:29,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:29,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:29,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:29,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:29,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 719 out of 777 [2022-11-21 16:36:29,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 695 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 721.3333333333334) internal successors, (2164), 3 states have internal predecessors, (2164), 0 states have call successors, (0), 0 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-21 16:36:29,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:29,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 719 of 777 [2022-11-21 16:36:29,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:30,847 INFO L130 PetriNetUnfolder]: 291/5679 cut-off events. [2022-11-21 16:36:30,847 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-21 16:36:30,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 5679 events. 291/5679 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 53706 event pairs, 26 based on Foata normal form. 0/4852 useless extension candidates. Maximal degree in co-relation 6189. Up to 172 conditions per place. [2022-11-21 16:36:30,946 INFO L137 encePairwiseOnDemand]: 760/777 looper letters, 28 selfloop transitions, 9 changer transitions 0/692 dead transitions. [2022-11-21 16:36:30,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 692 transitions, 1605 flow [2022-11-21 16:36:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2202 transitions. [2022-11-21 16:36:30,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446589446589446 [2022-11-21 16:36:30,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2202 transitions. [2022-11-21 16:36:30,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2202 transitions. [2022-11-21 16:36:30,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:30,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2202 transitions. [2022-11-21 16:36:30,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 734.0) internal successors, (2202), 3 states have internal predecessors, (2202), 0 states have call successors, (0), 0 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-21 16:36:30,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:30,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:30,955 INFO L175 Difference]: Start difference. First operand has 677 places, 695 transitions, 1536 flow. Second operand 3 states and 2202 transitions. [2022-11-21 16:36:30,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 692 transitions, 1605 flow [2022-11-21 16:36:30,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 692 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:36:30,969 INFO L231 Difference]: Finished difference. Result has 672 places, 691 transitions, 1568 flow [2022-11-21 16:36:30,970 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1568, PETRI_PLACES=672, PETRI_TRANSITIONS=691} [2022-11-21 16:36:30,970 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -48 predicate places. [2022-11-21 16:36:30,971 INFO L495 AbstractCegarLoop]: Abstraction has has 672 places, 691 transitions, 1568 flow [2022-11-21 16:36:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 721.3333333333334) internal successors, (2164), 3 states have internal predecessors, (2164), 0 states have call successors, (0), 0 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-21 16:36:30,971 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:30,972 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:30,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 16:36:30,972 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1446602599, now seen corresponding path program 1 times [2022-11-21 16:36:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:30,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268307542] [2022-11-21 16:36:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:31,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268307542] [2022-11-21 16:36:31,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268307542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:31,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:31,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:31,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843887729] [2022-11-21 16:36:31,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:31,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:31,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:31,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:31,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:31,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-21 16:36:31,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 691 transitions, 1568 flow. Second operand has 3 states, 3 states have (on average 719.6666666666666) internal successors, (2159), 3 states have internal predecessors, (2159), 0 states have call successors, (0), 0 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-21 16:36:31,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:31,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-21 16:36:31,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:32,508 INFO L130 PetriNetUnfolder]: 293/5673 cut-off events. [2022-11-21 16:36:32,508 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-11-21 16:36:32,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 5673 events. 293/5673 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 53653 event pairs, 54 based on Foata normal form. 0/4836 useless extension candidates. Maximal degree in co-relation 6351. Up to 271 conditions per place. [2022-11-21 16:36:32,607 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 35 selfloop transitions, 3 changer transitions 0/691 dead transitions. [2022-11-21 16:36:32,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 691 transitions, 1645 flow [2022-11-21 16:36:32,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2186 transitions. [2022-11-21 16:36:32,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9377949377949378 [2022-11-21 16:36:32,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2186 transitions. [2022-11-21 16:36:32,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2186 transitions. [2022-11-21 16:36:32,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:32,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2186 transitions. [2022-11-21 16:36:32,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 728.6666666666666) internal successors, (2186), 3 states have internal predecessors, (2186), 0 states have call successors, (0), 0 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-21 16:36:32,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:32,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:32,614 INFO L175 Difference]: Start difference. First operand has 672 places, 691 transitions, 1568 flow. Second operand 3 states and 2186 transitions. [2022-11-21 16:36:32,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 691 transitions, 1645 flow [2022-11-21 16:36:32,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 691 transitions, 1627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:32,623 INFO L231 Difference]: Finished difference. Result has 671 places, 690 transitions, 1554 flow [2022-11-21 16:36:32,624 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=671, PETRI_TRANSITIONS=690} [2022-11-21 16:36:32,624 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -49 predicate places. [2022-11-21 16:36:32,624 INFO L495 AbstractCegarLoop]: Abstraction has has 671 places, 690 transitions, 1554 flow [2022-11-21 16:36:32,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 719.6666666666666) internal successors, (2159), 3 states have internal predecessors, (2159), 0 states have call successors, (0), 0 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-21 16:36:32,625 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:32,625 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:32,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 16:36:32,626 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash 177630031, now seen corresponding path program 1 times [2022-11-21 16:36:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:32,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756221860] [2022-11-21 16:36:32,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:32,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756221860] [2022-11-21 16:36:32,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756221860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:32,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:32,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584916891] [2022-11-21 16:36:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:32,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:32,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 719 out of 777 [2022-11-21 16:36:32,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 690 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 721.6666666666666) internal successors, (2165), 3 states have internal predecessors, (2165), 0 states have call successors, (0), 0 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-21 16:36:32,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:32,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 719 of 777 [2022-11-21 16:36:32,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:34,418 INFO L130 PetriNetUnfolder]: 344/5844 cut-off events. [2022-11-21 16:36:34,418 INFO L131 PetriNetUnfolder]: For 116/118 co-relation queries the response was YES. [2022-11-21 16:36:34,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 5844 events. 344/5844 cut-off events. For 116/118 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 57323 event pairs, 30 based on Foata normal form. 0/5011 useless extension candidates. Maximal degree in co-relation 6542. Up to 262 conditions per place. [2022-11-21 16:36:34,530 INFO L137 encePairwiseOnDemand]: 760/777 looper letters, 28 selfloop transitions, 9 changer transitions 0/687 dead transitions. [2022-11-21 16:36:34,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 687 transitions, 1623 flow [2022-11-21 16:36:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2202 transitions. [2022-11-21 16:36:34,534 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446589446589446 [2022-11-21 16:36:34,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2202 transitions. [2022-11-21 16:36:34,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2202 transitions. [2022-11-21 16:36:34,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:34,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2202 transitions. [2022-11-21 16:36:34,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 734.0) internal successors, (2202), 3 states have internal predecessors, (2202), 0 states have call successors, (0), 0 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-21 16:36:34,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:34,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:34,541 INFO L175 Difference]: Start difference. First operand has 671 places, 690 transitions, 1554 flow. Second operand 3 states and 2202 transitions. [2022-11-21 16:36:34,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 687 transitions, 1623 flow [2022-11-21 16:36:34,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1617 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:34,556 INFO L231 Difference]: Finished difference. Result has 665 places, 686 transitions, 1584 flow [2022-11-21 16:36:34,557 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=665, PETRI_TRANSITIONS=686} [2022-11-21 16:36:34,560 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -55 predicate places. [2022-11-21 16:36:34,560 INFO L495 AbstractCegarLoop]: Abstraction has has 665 places, 686 transitions, 1584 flow [2022-11-21 16:36:34,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 721.6666666666666) internal successors, (2165), 3 states have internal predecessors, (2165), 0 states have call successors, (0), 0 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-21 16:36:34,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:34,562 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:34,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-21 16:36:34,562 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2006597985, now seen corresponding path program 1 times [2022-11-21 16:36:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:34,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809983435] [2022-11-21 16:36:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:34,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809983435] [2022-11-21 16:36:34,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809983435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:34,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:34,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056350286] [2022-11-21 16:36:34,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:34,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:34,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:34,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:34,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-21 16:36:34,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 686 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 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-21 16:36:34,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:34,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-21 16:36:34,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:36,209 INFO L130 PetriNetUnfolder]: 268/5737 cut-off events. [2022-11-21 16:36:36,209 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-21 16:36:36,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6565 conditions, 5737 events. 268/5737 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 55105 event pairs, 14 based on Foata normal form. 0/4983 useless extension candidates. Maximal degree in co-relation 6369. Up to 106 conditions per place. [2022-11-21 16:36:36,376 INFO L137 encePairwiseOnDemand]: 770/777 looper letters, 16 selfloop transitions, 3 changer transitions 0/683 dead transitions. [2022-11-21 16:36:36,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 683 transitions, 1617 flow [2022-11-21 16:36:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2022-11-21 16:36:36,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9583869583869584 [2022-11-21 16:36:36,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2234 transitions. [2022-11-21 16:36:36,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2234 transitions. [2022-11-21 16:36:36,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:36,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2234 transitions. [2022-11-21 16:36:36,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.6666666666666) internal successors, (2234), 3 states have internal predecessors, (2234), 0 states have call successors, (0), 0 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-21 16:36:36,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:36,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:36,386 INFO L175 Difference]: Start difference. First operand has 665 places, 686 transitions, 1584 flow. Second operand 3 states and 2234 transitions. [2022-11-21 16:36:36,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 683 transitions, 1617 flow [2022-11-21 16:36:36,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 683 transitions, 1599 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:36,399 INFO L231 Difference]: Finished difference. Result has 661 places, 682 transitions, 1564 flow [2022-11-21 16:36:36,400 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1564, PETRI_PLACES=661, PETRI_TRANSITIONS=682} [2022-11-21 16:36:36,400 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -59 predicate places. [2022-11-21 16:36:36,400 INFO L495 AbstractCegarLoop]: Abstraction has has 661 places, 682 transitions, 1564 flow [2022-11-21 16:36:36,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 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-21 16:36:36,401 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:36,401 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:36,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-21 16:36:36,402 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash -79944502, now seen corresponding path program 1 times [2022-11-21 16:36:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:36,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722566222] [2022-11-21 16:36:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:36,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722566222] [2022-11-21 16:36:36,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722566222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:36,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:36,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074641014] [2022-11-21 16:36:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:36,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:36,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:36,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:36,478 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-21 16:36:36,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 682 transitions, 1564 flow. Second operand has 3 states, 3 states have (on average 720.0) internal successors, (2160), 3 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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-21 16:36:36,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:36,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-21 16:36:36,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:38,142 INFO L130 PetriNetUnfolder]: 348/5806 cut-off events. [2022-11-21 16:36:38,142 INFO L131 PetriNetUnfolder]: For 239/241 co-relation queries the response was YES. [2022-11-21 16:36:38,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6861 conditions, 5806 events. 348/5806 cut-off events. For 239/241 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 57062 event pairs, 61 based on Foata normal form. 0/5013 useless extension candidates. Maximal degree in co-relation 6665. Up to 424 conditions per place. [2022-11-21 16:36:38,314 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 35 selfloop transitions, 3 changer transitions 0/682 dead transitions. [2022-11-21 16:36:38,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 682 transitions, 1641 flow [2022-11-21 16:36:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2186 transitions. [2022-11-21 16:36:38,317 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9377949377949378 [2022-11-21 16:36:38,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2186 transitions. [2022-11-21 16:36:38,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2186 transitions. [2022-11-21 16:36:38,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:38,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2186 transitions. [2022-11-21 16:36:38,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 728.6666666666666) internal successors, (2186), 3 states have internal predecessors, (2186), 0 states have call successors, (0), 0 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-21 16:36:38,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:38,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:38,321 INFO L175 Difference]: Start difference. First operand has 661 places, 682 transitions, 1564 flow. Second operand 3 states and 2186 transitions. [2022-11-21 16:36:38,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 682 transitions, 1641 flow [2022-11-21 16:36:38,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1635 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:38,333 INFO L231 Difference]: Finished difference. Result has 660 places, 681 transitions, 1562 flow [2022-11-21 16:36:38,334 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1562, PETRI_PLACES=660, PETRI_TRANSITIONS=681} [2022-11-21 16:36:38,335 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -60 predicate places. [2022-11-21 16:36:38,335 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 681 transitions, 1562 flow [2022-11-21 16:36:38,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 720.0) internal successors, (2160), 3 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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-21 16:36:38,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:38,336 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:38,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-21 16:36:38,337 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 149805970, now seen corresponding path program 1 times [2022-11-21 16:36:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:38,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500473053] [2022-11-21 16:36:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:38,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500473053] [2022-11-21 16:36:38,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500473053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:38,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:38,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:38,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28898967] [2022-11-21 16:36:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:38,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:38,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:38,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:38,455 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-21 16:36:38,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 681 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 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-21 16:36:38,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:38,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-21 16:36:38,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:39,968 INFO L130 PetriNetUnfolder]: 301/5704 cut-off events. [2022-11-21 16:36:39,968 INFO L131 PetriNetUnfolder]: For 78/80 co-relation queries the response was YES. [2022-11-21 16:36:40,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6537 conditions, 5704 events. 301/5704 cut-off events. For 78/80 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 54104 event pairs, 18 based on Foata normal form. 0/4989 useless extension candidates. Maximal degree in co-relation 6341. Up to 162 conditions per place. [2022-11-21 16:36:40,093 INFO L137 encePairwiseOnDemand]: 770/777 looper letters, 16 selfloop transitions, 3 changer transitions 0/678 dead transitions. [2022-11-21 16:36:40,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 678 transitions, 1595 flow [2022-11-21 16:36:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2022-11-21 16:36:40,096 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9583869583869584 [2022-11-21 16:36:40,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2234 transitions. [2022-11-21 16:36:40,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2234 transitions. [2022-11-21 16:36:40,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:40,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2234 transitions. [2022-11-21 16:36:40,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.6666666666666) internal successors, (2234), 3 states have internal predecessors, (2234), 0 states have call successors, (0), 0 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-21 16:36:40,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:40,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:40,101 INFO L175 Difference]: Start difference. First operand has 660 places, 681 transitions, 1562 flow. Second operand 3 states and 2234 transitions. [2022-11-21 16:36:40,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 678 transitions, 1595 flow [2022-11-21 16:36:40,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 678 transitions, 1589 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:40,113 INFO L231 Difference]: Finished difference. Result has 656 places, 677 transitions, 1554 flow [2022-11-21 16:36:40,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=656, PETRI_TRANSITIONS=677} [2022-11-21 16:36:40,115 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -64 predicate places. [2022-11-21 16:36:40,115 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 677 transitions, 1554 flow [2022-11-21 16:36:40,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 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-21 16:36:40,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:40,116 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:40,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-21 16:36:40,116 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash 245192492, now seen corresponding path program 1 times [2022-11-21 16:36:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:40,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333202541] [2022-11-21 16:36:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:40,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333202541] [2022-11-21 16:36:40,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333202541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:40,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729003320] [2022-11-21 16:36:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:40,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:40,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:40,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:40,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 777 [2022-11-21 16:36:40,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 677 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 0 states have call successors, (0), 0 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-21 16:36:40,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:40,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 777 [2022-11-21 16:36:40,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:42,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,528 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-21 16:36:42,528 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:36:42,528 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:36:42,529 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-21 16:36:42,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,529 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-21 16:36:42,529 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-21 16:36:42,529 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,530 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,536 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-21 16:36:42,536 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,536 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,536 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-21 16:36:42,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), 413#L55-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,559 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-21 16:36:42,559 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:36:42,560 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-21 16:36:42,560 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:36:42,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,604 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:36:42,604 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,604 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,604 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,605 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,605 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:42,605 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:42,605 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,605 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,608 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:36:42,608 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,609 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,609 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,612 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:42,612 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:42,612 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,612 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,619 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:42,619 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,619 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:42,625 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,628 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,628 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:42,628 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,628 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,629 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:42,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), 413#L55-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,646 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:36:42,646 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,646 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,647 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, 413#L55-2true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,649 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:36:42,649 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,649 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:36:42,650 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:42,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,685 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-21 16:36:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:36:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:36:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,685 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:36:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:42,686 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:36:42,690 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,690 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:36:42,690 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:42,690 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:36:42,690 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:42,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, 413#L55-2true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,702 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-21 16:36:42,702 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:36:42,703 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:36:42,703 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:42,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 625#L76-2true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,810 INFO L383 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-11-21 16:36:42,810 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-21 16:36:42,810 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-21 16:36:42,810 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-21 16:36:42,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,811 INFO L383 tUnfolder$Statistics]: this new event has 386 ancestors and is cut-off event [2022-11-21 16:36:42,811 INFO L386 tUnfolder$Statistics]: existing Event has 298 ancestors and is cut-off event [2022-11-21 16:36:42,811 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-21 16:36:42,811 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-21 16:36:42,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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)), 625#L76-2true, Black: 1841#true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,841 INFO L383 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-11-21 16:36:42,841 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-21 16:36:42,841 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-21 16:36:42,841 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-21 16:36:42,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,842 INFO L383 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-11-21 16:36:42,842 INFO L386 tUnfolder$Statistics]: existing Event has 301 ancestors and is cut-off event [2022-11-21 16:36:42,842 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-21 16:36:42,842 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-21 16:36:42,882 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,882 INFO L383 tUnfolder$Statistics]: this new event has 386 ancestors and is cut-off event [2022-11-21 16:36:42,882 INFO L386 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-11-21 16:36:42,882 INFO L386 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-11-21 16:36:42,883 INFO L386 tUnfolder$Statistics]: existing Event has 386 ancestors and is cut-off event [2022-11-21 16:36:42,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:42,909 INFO L383 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-11-21 16:36:42,909 INFO L386 tUnfolder$Statistics]: existing Event has 393 ancestors and is cut-off event [2022-11-21 16:36:42,909 INFO L386 tUnfolder$Statistics]: existing Event has 393 ancestors and is cut-off event [2022-11-21 16:36:42,909 INFO L386 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-11-21 16:36:42,998 INFO L130 PetriNetUnfolder]: 565/10690 cut-off events. [2022-11-21 16:36:42,999 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-11-21 16:36:43,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12023 conditions, 10690 events. 565/10690 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 108517 event pairs, 22 based on Foata normal form. 0/9354 useless extension candidates. Maximal degree in co-relation 11829. Up to 298 conditions per place. [2022-11-21 16:36:43,250 INFO L137 encePairwiseOnDemand]: 773/777 looper letters, 11 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2022-11-21 16:36:43,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 679 transitions, 1586 flow [2022-11-21 16:36:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2022-11-21 16:36:43,253 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9703989703989704 [2022-11-21 16:36:43,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2262 transitions. [2022-11-21 16:36:43,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2262 transitions. [2022-11-21 16:36:43,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:43,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2262 transitions. [2022-11-21 16:36:43,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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-21 16:36:43,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:43,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:43,260 INFO L175 Difference]: Start difference. First operand has 656 places, 677 transitions, 1554 flow. Second operand 3 states and 2262 transitions. [2022-11-21 16:36:43,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 679 transitions, 1586 flow [2022-11-21 16:36:43,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 679 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:43,273 INFO L231 Difference]: Finished difference. Result has 655 places, 677 transitions, 1558 flow [2022-11-21 16:36:43,275 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1558, PETRI_PLACES=655, PETRI_TRANSITIONS=677} [2022-11-21 16:36:43,275 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -65 predicate places. [2022-11-21 16:36:43,275 INFO L495 AbstractCegarLoop]: Abstraction has has 655 places, 677 transitions, 1558 flow [2022-11-21 16:36:43,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 0 states have call successors, (0), 0 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-21 16:36:43,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:43,276 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:43,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-21 16:36:43,277 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1886329524, now seen corresponding path program 1 times [2022-11-21 16:36:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:43,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619659526] [2022-11-21 16:36:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:43,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:43,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619659526] [2022-11-21 16:36:43,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619659526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:43,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:43,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171840524] [2022-11-21 16:36:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:43,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:43,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:43,349 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 777 [2022-11-21 16:36:43,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 677 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 0 states have call successors, (0), 0 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-21 16:36:43,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:43,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 777 [2022-11-21 16:36:43,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:45,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,571 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-21 16:36:45,572 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:45,572 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-21 16:36:45,572 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:45,572 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,572 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:45,573 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,573 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,573 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:45,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,630 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:45,630 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:45,630 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,630 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,631 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:36:45,631 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:45,631 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:36:45,631 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:45,893 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1880#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,893 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-21 16:36:45,893 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-21 16:36:45,893 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:45,893 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:36:45,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,932 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:45,932 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:45,932 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,933 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,934 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,934 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:36:45,934 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,934 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:36:45,934 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:36:45,978 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:36:45,979 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:36:45,979 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:45,979 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:36:45,979 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:36:46,130 INFO L130 PetriNetUnfolder]: 505/10323 cut-off events. [2022-11-21 16:36:46,130 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-11-21 16:36:46,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11931 conditions, 10323 events. 505/10323 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 106192 event pairs, 64 based on Foata normal form. 0/9124 useless extension candidates. Maximal degree in co-relation 11735. Up to 375 conditions per place. [2022-11-21 16:36:46,397 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 27 selfloop transitions, 3 changer transitions 0/677 dead transitions. [2022-11-21 16:36:46,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 677 transitions, 1619 flow [2022-11-21 16:36:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2196 transitions. [2022-11-21 16:36:46,400 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420849420849421 [2022-11-21 16:36:46,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2196 transitions. [2022-11-21 16:36:46,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2196 transitions. [2022-11-21 16:36:46,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:46,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2196 transitions. [2022-11-21 16:36:46,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 0 states have call successors, (0), 0 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-21 16:36:46,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:46,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-21 16:36:46,406 INFO L175 Difference]: Start difference. First operand has 655 places, 677 transitions, 1558 flow. Second operand 3 states and 2196 transitions. [2022-11-21 16:36:46,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 677 transitions, 1619 flow [2022-11-21 16:36:46,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 677 transitions, 1619 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:36:46,419 INFO L231 Difference]: Finished difference. Result has 656 places, 676 transitions, 1562 flow [2022-11-21 16:36:46,420 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1562, PETRI_PLACES=656, PETRI_TRANSITIONS=676} [2022-11-21 16:36:46,421 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -64 predicate places. [2022-11-21 16:36:46,421 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 676 transitions, 1562 flow [2022-11-21 16:36:46,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 0 states have call successors, (0), 0 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-21 16:36:46,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:46,422 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:46,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-21 16:36:46,423 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash 965451389, now seen corresponding path program 1 times [2022-11-21 16:36:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800112390] [2022-11-21 16:36:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:46,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800112390] [2022-11-21 16:36:46,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800112390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:46,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:46,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:36:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260773577] [2022-11-21 16:36:46,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:36:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:36:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:36:46,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 777 [2022-11-21 16:36:46,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 676 transitions, 1562 flow. Second operand has 4 states, 4 states have (on average 742.5) internal successors, (2970), 4 states have internal predecessors, (2970), 0 states have call successors, (0), 0 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-21 16:36:46,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:46,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 777 [2022-11-21 16:36:46,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:50,047 INFO L130 PetriNetUnfolder]: 655/13733 cut-off events. [2022-11-21 16:36:50,047 INFO L131 PetriNetUnfolder]: For 32/34 co-relation queries the response was YES. [2022-11-21 16:36:50,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15635 conditions, 13733 events. 655/13733 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 142944 event pairs, 42 based on Foata normal form. 0/12139 useless extension candidates. Maximal degree in co-relation 15438. Up to 287 conditions per place. [2022-11-21 16:36:50,323 INFO L137 encePairwiseOnDemand]: 769/777 looper letters, 33 selfloop transitions, 8 changer transitions 0/695 dead transitions. [2022-11-21 16:36:50,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 695 transitions, 1686 flow [2022-11-21 16:36:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:36:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 16:36:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3737 transitions. [2022-11-21 16:36:50,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9619047619047619 [2022-11-21 16:36:50,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3737 transitions. [2022-11-21 16:36:50,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3737 transitions. [2022-11-21 16:36:50,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:50,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3737 transitions. [2022-11-21 16:36:50,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 747.4) internal successors, (3737), 5 states have internal predecessors, (3737), 0 states have call successors, (0), 0 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-21 16:36:50,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 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-21 16:36:50,335 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 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-21 16:36:50,335 INFO L175 Difference]: Start difference. First operand has 656 places, 676 transitions, 1562 flow. Second operand 5 states and 3737 transitions. [2022-11-21 16:36:50,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 695 transitions, 1686 flow [2022-11-21 16:36:50,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 695 transitions, 1680 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:50,348 INFO L231 Difference]: Finished difference. Result has 661 places, 680 transitions, 1602 flow [2022-11-21 16:36:50,349 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1602, PETRI_PLACES=661, PETRI_TRANSITIONS=680} [2022-11-21 16:36:50,350 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -59 predicate places. [2022-11-21 16:36:50,350 INFO L495 AbstractCegarLoop]: Abstraction has has 661 places, 680 transitions, 1602 flow [2022-11-21 16:36:50,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 742.5) internal successors, (2970), 4 states have internal predecessors, (2970), 0 states have call successors, (0), 0 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-21 16:36:50,351 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:50,351 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:50,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-21 16:36:50,351 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:36:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 262304863, now seen corresponding path program 1 times [2022-11-21 16:36:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87219947] [2022-11-21 16:36:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:36:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87219947] [2022-11-21 16:36:51,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87219947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:51,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:51,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:36:51,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686797139] [2022-11-21 16:36:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:51,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:36:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:51,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:36:51,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:51,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-21 16:36:51,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 680 transitions, 1602 flow. Second operand has 6 states, 6 states have (on average 720.0) internal successors, (4320), 6 states have internal predecessors, (4320), 0 states have call successors, (0), 0 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-21 16:36:51,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:51,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-21 16:36:51,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:37:07,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:07,303 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:37:07,303 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:07,303 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:07,303 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:07,758 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, 506#L108-4true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:07,758 INFO L383 tUnfolder$Statistics]: this new event has 358 ancestors and is cut-off event [2022-11-21 16:37:07,758 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-21 16:37:07,758 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:37:07,758 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:37:07,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, Black: 1875#true, 444#L54-3true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:07,763 INFO L383 tUnfolder$Statistics]: this new event has 358 ancestors and is cut-off event [2022-11-21 16:37:07,763 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-21 16:37:07,763 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:37:07,763 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:37:07,764 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:07,764 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:37:07,764 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:07,764 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:07,764 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:07,893 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:07,893 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-21 16:37:07,893 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:07,893 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:37:07,893 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:37:08,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, 506#L108-4true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,428 INFO L383 tUnfolder$Statistics]: this new event has 361 ancestors and is cut-off event [2022-11-21 16:37:08,428 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:08,428 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:08,428 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-21 16:37:08,432 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, Black: 1875#true, 444#L54-3true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,432 INFO L383 tUnfolder$Statistics]: this new event has 361 ancestors and is cut-off event [2022-11-21 16:37:08,432 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-21 16:37:08,432 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:08,432 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:08,550 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,550 INFO L383 tUnfolder$Statistics]: this new event has 362 ancestors and is cut-off event [2022-11-21 16:37:08,550 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:08,550 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:37:08,550 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:08,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,556 INFO L383 tUnfolder$Statistics]: this new event has 362 ancestors and is cut-off event [2022-11-21 16:37:08,556 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-21 16:37:08,556 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:08,556 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:08,557 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,557 INFO L383 tUnfolder$Statistics]: this new event has 373 ancestors and is cut-off event [2022-11-21 16:37:08,557 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-21 16:37:08,557 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:08,557 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-21 16:37:08,669 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,669 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-21 16:37:08,669 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-21 16:37:08,669 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:37:08,669 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:37:08,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 444#L54-3true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,674 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-21 16:37:08,675 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-21 16:37:08,675 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:37:08,675 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:37:08,799 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,799 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-21 16:37:08,799 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-21 16:37:08,799 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:37:08,799 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:37:08,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,807 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-21 16:37:08,807 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:37:08,807 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-21 16:37:08,807 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:37:08,916 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,916 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-21 16:37:08,916 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,916 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,916 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:08,921 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,921 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-21 16:37:08,921 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,921 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,921 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:08,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,989 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-21 16:37:08,989 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,989 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,989 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:08,995 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:08,995 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-21 16:37:08,996 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,996 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:08,996 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-21 16:37:09,230 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,230 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:37:09,230 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,235 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,236 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:09,241 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,241 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:37:09,242 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,242 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,242 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:09,298 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,298 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:37:09,298 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:09,298 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,298 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,302 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,302 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:37:09,302 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:09,302 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,303 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,349 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-21 16:37:09,349 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,349 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,350 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-21 16:37:09,405 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,406 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:37:09,406 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:37:09,406 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:37:09,406 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:37:09,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,410 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-21 16:37:09,410 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:37:09,410 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-21 16:37:09,410 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-21 16:37:09,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,514 INFO L383 tUnfolder$Statistics]: this new event has 368 ancestors and is cut-off event [2022-11-21 16:37:09,515 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:37:09,515 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-21 16:37:09,515 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-21 16:37:09,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,519 INFO L383 tUnfolder$Statistics]: this new event has 368 ancestors and is cut-off event [2022-11-21 16:37:09,519 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-21 16:37:09,519 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-21 16:37:09,519 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-21 16:37:09,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,620 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:37:09,620 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:09,620 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:09,620 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:09,624 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 444#L54-3true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,624 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:37:09,624 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:09,624 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:09,624 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:09,725 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,725 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-21 16:37:09,725 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:09,725 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:09,725 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-21 16:37:09,821 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:09,821 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-21 16:37:09,821 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-21 16:37:09,821 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:37:09,821 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-21 16:37:10,441 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:10,441 INFO L383 tUnfolder$Statistics]: this new event has 373 ancestors and is cut-off event [2022-11-21 16:37:10,441 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-21 16:37:10,441 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-21 16:37:10,442 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-21 16:37:13,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:13,548 INFO L383 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-11-21 16:37:13,548 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-21 16:37:13,548 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-21 16:37:13,548 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-21 16:37:14,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 293#L110-3true, 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,350 INFO L383 tUnfolder$Statistics]: this new event has 394 ancestors and is cut-off event [2022-11-21 16:37:14,350 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-21 16:37:14,350 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-21 16:37:14,350 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-21 16:37:14,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 36#L110-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,351 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-21 16:37:14,351 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-21 16:37:14,351 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-21 16:37:14,351 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-21 16:37:14,351 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 628#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,351 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-21 16:37:14,351 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-21 16:37:14,351 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-21 16:37:14,351 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 64#L110-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,352 INFO L383 tUnfolder$Statistics]: this new event has 393 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 391#L110-6true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,352 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-21 16:37:14,352 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-21 16:37:14,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 584#L110-4true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,353 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-21 16:37:14,353 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-21 16:37:14,353 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-21 16:37:14,353 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-21 16:37:14,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 688#L109-7true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,353 INFO L383 tUnfolder$Statistics]: this new event has 393 ancestors and is cut-off event [2022-11-21 16:37:14,354 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-21 16:37:14,354 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-21 16:37:14,354 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-21 16:37:14,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 293#L110-3true, 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,908 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-21 16:37:14,908 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-21 16:37:14,908 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-21 16:37:14,908 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 36#L110-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,909 INFO L383 tUnfolder$Statistics]: this new event has 399 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 628#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,909 INFO L383 tUnfolder$Statistics]: this new event has 400 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-21 16:37:14,909 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 64#L110-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,910 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 391#L110-6true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,910 INFO L383 tUnfolder$Statistics]: this new event has 400 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-21 16:37:14,910 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-21 16:37:14,911 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 584#L110-4true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(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: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:14,911 INFO L383 tUnfolder$Statistics]: this new event has 398 ancestors and is cut-off event [2022-11-21 16:37:14,911 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-21 16:37:14,911 INFO L386 tUnfolder$Statistics]: existing Event has 314 ancestors and is cut-off event [2022-11-21 16:37:14,911 INFO L386 tUnfolder$Statistics]: existing Event has 314 ancestors and is cut-off event [2022-11-21 16:37:24,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:24,617 INFO L383 tUnfolder$Statistics]: this new event has 454 ancestors and is cut-off event [2022-11-21 16:37:24,618 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-21 16:37:24,618 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-21 16:37:24,618 INFO L386 tUnfolder$Statistics]: existing Event has 366 ancestors and is cut-off event [2022-11-21 16:37:24,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:24,618 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-21 16:37:24,618 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-21 16:37:24,619 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-21 16:37:24,619 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-21 16:37:24,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:24,935 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-21 16:37:24,935 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-21 16:37:24,935 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-21 16:37:24,935 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-21 16:37:24,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:24,935 INFO L383 tUnfolder$Statistics]: this new event has 460 ancestors and is cut-off event [2022-11-21 16:37:24,935 INFO L386 tUnfolder$Statistics]: existing Event has 372 ancestors and is cut-off event [2022-11-21 16:37:24,935 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-21 16:37:24,936 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,046 INFO L383 tUnfolder$Statistics]: this new event has 458 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,046 INFO L383 tUnfolder$Statistics]: this new event has 461 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,046 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-21 16:37:25,130 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 548#L109-3true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,130 INFO L383 tUnfolder$Statistics]: this new event has 462 ancestors and is cut-off event [2022-11-21 16:37:25,131 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-21 16:37:25,131 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-21 16:37:25,131 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-21 16:37:25,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 548#L109-3true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,131 INFO L383 tUnfolder$Statistics]: this new event has 459 ancestors and is cut-off event [2022-11-21 16:37:25,131 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-21 16:37:25,131 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-21 16:37:25,131 INFO L386 tUnfolder$Statistics]: existing Event has 371 ancestors and is cut-off event [2022-11-21 16:37:25,438 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,438 INFO L383 tUnfolder$Statistics]: this new event has 460 ancestors and is cut-off event [2022-11-21 16:37:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-21 16:37:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 372 ancestors and is cut-off event [2022-11-21 16:37:25,438 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-21 16:37:25,438 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,439 INFO L383 tUnfolder$Statistics]: this new event has 463 ancestors and is cut-off event [2022-11-21 16:37:25,439 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-21 16:37:25,439 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-21 16:37:25,439 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-21 16:37:25,515 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,515 INFO L383 tUnfolder$Statistics]: this new event has 461 ancestors and is cut-off event [2022-11-21 16:37:25,515 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-21 16:37:25,515 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,515 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,516 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, 371#L109-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,516 INFO L383 tUnfolder$Statistics]: this new event has 464 ancestors and is cut-off event [2022-11-21 16:37:25,516 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-21 16:37:25,516 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-21 16:37:25,516 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-21 16:37:25,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,577 INFO L383 tUnfolder$Statistics]: this new event has 461 ancestors and is cut-off event [2022-11-21 16:37:25,577 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,577 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-21 16:37:25,577 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,578 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,578 INFO L383 tUnfolder$Statistics]: this new event has 464 ancestors and is cut-off event [2022-11-21 16:37:25,578 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-21 16:37:25,578 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-21 16:37:25,578 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-21 16:37:25,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,603 INFO L383 tUnfolder$Statistics]: this new event has 462 ancestors and is cut-off event [2022-11-21 16:37:25,603 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-21 16:37:25,603 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-21 16:37:25,603 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-21 16:37:25,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,604 INFO L383 tUnfolder$Statistics]: this new event has 465 ancestors and is cut-off event [2022-11-21 16:37:25,604 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-21 16:37:25,604 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-21 16:37:25,604 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 548#L109-3true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,658 INFO L383 tUnfolder$Statistics]: this new event has 465 ancestors and is cut-off event [2022-11-21 16:37:25,658 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-21 16:37:25,659 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-21 16:37:25,659 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 548#L109-3true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,659 INFO L383 tUnfolder$Statistics]: this new event has 462 ancestors and is cut-off event [2022-11-21 16:37:25,659 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-21 16:37:25,659 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-21 16:37:25,659 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-21 16:37:25,732 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,732 INFO L383 tUnfolder$Statistics]: this new event has 463 ancestors and is cut-off event [2022-11-21 16:37:25,732 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-21 16:37:25,732 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-21 16:37:25,732 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-21 16:37:25,732 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1816#(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)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,733 INFO L383 tUnfolder$Statistics]: this new event has 466 ancestors and is cut-off event [2022-11-21 16:37:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 382 ancestors and is cut-off event [2022-11-21 16:37:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-21 16:37:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 382 ancestors and is cut-off event [2022-11-21 16:37:25,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,808 INFO L383 tUnfolder$Statistics]: this new event has 464 ancestors and is cut-off event [2022-11-21 16:37:25,809 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-21 16:37:25,809 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-21 16:37:25,809 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-21 16:37:25,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, 371#L109-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,809 INFO L383 tUnfolder$Statistics]: this new event has 467 ancestors and is cut-off event [2022-11-21 16:37:25,809 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-21 16:37:25,809 INFO L386 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2022-11-21 16:37:25,809 INFO L386 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2022-11-21 16:37:25,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1884#true, Black: 1886#(= ~i_4~0 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, Black: 1875#true, 389#L76-1true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,881 INFO L383 tUnfolder$Statistics]: this new event has 465 ancestors and is cut-off event [2022-11-21 16:37:25,881 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-21 16:37:25,882 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-21 16:37:25,882 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-21 16:37:25,882 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(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: 1841#true, 389#L76-1true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-21 16:37:25,882 INFO L383 tUnfolder$Statistics]: this new event has 468 ancestors and is cut-off event [2022-11-21 16:37:25,882 INFO L386 tUnfolder$Statistics]: existing Event has 384 ancestors and is cut-off event [2022-11-21 16:37:25,882 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-21 16:37:25,882 INFO L386 tUnfolder$Statistics]: existing Event has 384 ancestors and is cut-off event [2022-11-21 16:37:28,102 INFO L130 PetriNetUnfolder]: 17497/133260 cut-off events. [2022-11-21 16:37:28,102 INFO L131 PetriNetUnfolder]: For 2229/2253 co-relation queries the response was YES. [2022-11-21 16:37:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166812 conditions, 133260 events. 17497/133260 cut-off events. For 2229/2253 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 2048830 event pairs, 4538 based on Foata normal form. 0/115670 useless extension candidates. Maximal degree in co-relation 166593. Up to 8922 conditions per place. [2022-11-21 16:37:30,457 INFO L137 encePairwiseOnDemand]: 771/777 looper letters, 89 selfloop transitions, 6 changer transitions 0/731 dead transitions. [2022-11-21 16:37:30,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 731 transitions, 1902 flow [2022-11-21 16:37:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:37:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:37:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4396 transitions. [2022-11-21 16:37:30,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9429429429429429 [2022-11-21 16:37:30,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4396 transitions. [2022-11-21 16:37:30,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4396 transitions. [2022-11-21 16:37:30,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:37:30,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4396 transitions. [2022-11-21 16:37:30,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 732.6666666666666) internal successors, (4396), 6 states have internal predecessors, (4396), 0 states have call successors, (0), 0 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-21 16:37:30,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 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-21 16:37:30,483 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 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-21 16:37:30,483 INFO L175 Difference]: Start difference. First operand has 661 places, 680 transitions, 1602 flow. Second operand 6 states and 4396 transitions. [2022-11-21 16:37:30,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 731 transitions, 1902 flow [2022-11-21 16:37:30,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 731 transitions, 1902 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:37:30,553 INFO L231 Difference]: Finished difference. Result has 665 places, 679 transitions, 1612 flow [2022-11-21 16:37:30,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1612, PETRI_PLACES=665, PETRI_TRANSITIONS=679} [2022-11-21 16:37:30,554 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -55 predicate places. [2022-11-21 16:37:30,555 INFO L495 AbstractCegarLoop]: Abstraction has has 665 places, 679 transitions, 1612 flow [2022-11-21 16:37:30,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 720.0) internal successors, (4320), 6 states have internal predecessors, (4320), 0 states have call successors, (0), 0 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-21 16:37:30,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:37:30,557 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:37:30,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-21 16:37:30,557 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-21 16:37:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:37:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1600708021, now seen corresponding path program 1 times [2022-11-21 16:37:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:37:30,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082979222] [2022-11-21 16:37:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:37:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:37:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-21 16:37:30,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:37:30,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082979222] [2022-11-21 16:37:30,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082979222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:37:30,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:37:30,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:37:30,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660653963] [2022-11-21 16:37:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:37:30,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:37:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:37:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:37:30,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:37:30,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 777 [2022-11-21 16:37:30,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 679 transitions, 1612 flow. Second operand has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-21 16:37:30,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:37:30,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 777 [2022-11-21 16:37:30,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand