./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:30:47,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:30:47,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:30:47,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:30:47,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:30:47,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:30:47,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:30:47,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:30:47,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:30:47,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:30:47,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:30:47,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:30:47,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:30:47,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:30:47,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:30:47,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:30:47,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:30:47,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:30:47,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:30:47,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:30:47,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:30:47,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:30:47,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:30:47,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:30:47,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:30:47,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:30:47,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:30:47,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:30:47,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:30:47,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:30:47,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:30:47,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:30:47,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:30:47,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:30:47,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:30:47,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:30:47,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:30:47,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:30:47,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:30:47,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:30:47,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:30:47,892 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:30:47,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:30:47,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:30:47,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:30:47,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:30:47,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:30:47,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:30:47,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:30:47,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:30:47,922 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:30:47,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:30:47,922 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:30:47,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:30:47,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:30:47,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:30:47,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:30:47,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:30:47,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:30:47,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:30:47,925 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:30:47,925 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:30:47,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:30:47,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:30:47,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:30:47,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:30:47,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:30:47,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:30:47,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:47,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:30:47,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:30:47,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:30:47,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:30:47,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:30:47,929 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:30:47,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:30:47,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:30:47,930 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_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2022-11-02 20:30:48,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:30:48,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:30:48,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:30:48,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:30:48,294 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:30:48,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-02 20:30:48,400 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/data/541dbeebf/6e4e9eaf993444db872b2ded7c029141/FLAG401479a84 [2022-11-02 20:30:48,951 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:30:48,952 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-02 20:30:48,961 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/data/541dbeebf/6e4e9eaf993444db872b2ded7c029141/FLAG401479a84 [2022-11-02 20:30:49,329 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/data/541dbeebf/6e4e9eaf993444db872b2ded7c029141 [2022-11-02 20:30:49,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:30:49,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:30:49,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:49,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:30:49,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:30:49,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e81d621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49, skipping insertion in model container [2022-11-02 20:30:49,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:30:49,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:30:49,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-02 20:30:49,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:49,810 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:30:49,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-02 20:30:49,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:49,893 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:30:49,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49 WrapperNode [2022-11-02 20:30:49,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:49,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:49,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:30:49,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:30:49,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,952 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 172 [2022-11-02 20:30:49,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:49,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:30:49,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:30:49,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:30:49,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:49,999 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:50,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:50,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:30:50,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:30:50,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:30:50,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:30:50,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (1/1) ... [2022-11-02 20:30:50,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:50,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:50,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:30:50,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c54ee6-47e9-43e1-83aa-1e00cd2dfcf6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:30:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:30:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:30:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:30:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:30:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:30:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:30:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:30:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:30:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:30:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:30:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:30:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:30:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:30:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:30:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:30:50,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:30:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:30:50,107 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:30:50,251 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:30:50,267 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:30:51,117 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:30:51,251 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:30:51,251 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:30:51,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:51 BoogieIcfgContainer [2022-11-02 20:30:51,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:30:51,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:30:51,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:30:51,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:30:51,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:30:49" (1/3) ... [2022-11-02 20:30:51,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f170a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:51, skipping insertion in model container [2022-11-02 20:30:51,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:49" (2/3) ... [2022-11-02 20:30:51,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f170a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:51, skipping insertion in model container [2022-11-02 20:30:51,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:51" (3/3) ... [2022-11-02 20:30:51,287 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-11-02 20:30:51,306 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:30:51,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:30:51,323 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-02 20:30:51,323 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:30:51,454 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:30:51,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 285 transitions, 594 flow [2022-11-02 20:30:51,637 INFO L130 PetriNetUnfolder]: 16/282 cut-off events. [2022-11-02 20:30:51,637 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:30:51,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 282 events. 16/282 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2022-11-02 20:30:51,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 285 transitions, 594 flow [2022-11-02 20:30:51,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 262 transitions, 542 flow [2022-11-02 20:30:51,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:30:51,680 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;@2908786d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:30:51,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-02 20:30:51,688 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-02 20:30:51,689 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:30:51,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:51,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:51,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:51,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -956837861, now seen corresponding path program 1 times [2022-11-02 20:30:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:51,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414205060] [2022-11-02 20:30:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:51,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:51,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414205060] [2022-11-02 20:30:51,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414205060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:51,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:51,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841125531] [2022-11-02 20:30:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:52,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:52,056 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 285 [2022-11-02 20:30:52,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 262 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:52,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 285 [2022-11-02 20:30:52,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:52,766 INFO L130 PetriNetUnfolder]: 452/1339 cut-off events. [2022-11-02 20:30:52,766 INFO L131 PetriNetUnfolder]: For 218/381 co-relation queries the response was YES. [2022-11-02 20:30:52,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1339 events. 452/1339 cut-off events. For 218/381 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8196 event pairs, 311 based on Foata normal form. 6/1039 useless extension candidates. Maximal degree in co-relation 1813. Up to 643 conditions per place. [2022-11-02 20:30:52,798 INFO L137 encePairwiseOnDemand]: 263/285 looper letters, 30 selfloop transitions, 2 changer transitions 4/242 dead transitions. [2022-11-02 20:30:52,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 566 flow [2022-11-02 20:30:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2022-11-02 20:30:52,833 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8678362573099415 [2022-11-02 20:30:52,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2022-11-02 20:30:52,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2022-11-02 20:30:52,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:52,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2022-11-02 20:30:52,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,868 INFO L175 Difference]: Start difference. First operand has 257 places, 262 transitions, 542 flow. Second operand 3 states and 742 transitions. [2022-11-02 20:30:52,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 566 flow [2022-11-02 20:30:52,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 242 transitions, 554 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:30:52,891 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 486 flow [2022-11-02 20:30:52,894 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2022-11-02 20:30:52,901 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -15 predicate places. [2022-11-02 20:30:52,901 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 486 flow [2022-11-02 20:30:52,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:52,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:52,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:30:52,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -379582126, now seen corresponding path program 1 times [2022-11-02 20:30:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:52,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774834910] [2022-11-02 20:30:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:53,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774834910] [2022-11-02 20:30:53,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774834910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:53,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:53,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528652419] [2022-11-02 20:30:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:53,066 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2022-11-02 20:30:53,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:53,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:53,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2022-11-02 20:30:53,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:53,377 INFO L130 PetriNetUnfolder]: 262/950 cut-off events. [2022-11-02 20:30:53,377 INFO L131 PetriNetUnfolder]: For 32/121 co-relation queries the response was YES. [2022-11-02 20:30:53,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 950 events. 262/950 cut-off events. For 32/121 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5200 event pairs, 164 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 1306. Up to 365 conditions per place. [2022-11-02 20:30:53,390 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 21 selfloop transitions, 1 changer transitions 2/232 dead transitions. [2022-11-02 20:30:53,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 520 flow [2022-11-02 20:30:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2022-11-02 20:30:53,393 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8514619883040936 [2022-11-02 20:30:53,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 728 transitions. [2022-11-02 20:30:53,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 728 transitions. [2022-11-02 20:30:53,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:53,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 728 transitions. [2022-11-02 20:30:53,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:53,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:53,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:53,402 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 486 flow. Second operand 3 states and 728 transitions. [2022-11-02 20:30:53,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 520 flow [2022-11-02 20:30:53,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 232 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:53,416 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 468 flow [2022-11-02 20:30:53,417 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2022-11-02 20:30:53,419 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -25 predicate places. [2022-11-02 20:30:53,419 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 468 flow [2022-11-02 20:30:53,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:53,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:53,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:53,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:30:53,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:53,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1223527727, now seen corresponding path program 1 times [2022-11-02 20:30:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:53,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661650530] [2022-11-02 20:30:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:54,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661650530] [2022-11-02 20:30:54,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661650530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:54,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:54,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587524994] [2022-11-02 20:30:54,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:54,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:54,204 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 285 [2022-11-02 20:30:54,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:54,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:54,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 285 [2022-11-02 20:30:54,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:55,208 INFO L130 PetriNetUnfolder]: 1300/2596 cut-off events. [2022-11-02 20:30:55,209 INFO L131 PetriNetUnfolder]: For 9/60 co-relation queries the response was YES. [2022-11-02 20:30:55,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 2596 events. 1300/2596 cut-off events. For 9/60 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16648 event pairs, 1040 based on Foata normal form. 0/2224 useless extension candidates. Maximal degree in co-relation 4473. Up to 1868 conditions per place. [2022-11-02 20:30:55,246 INFO L137 encePairwiseOnDemand]: 273/285 looper letters, 56 selfloop transitions, 10 changer transitions 0/228 dead transitions. [2022-11-02 20:30:55,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 228 transitions, 596 flow [2022-11-02 20:30:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:30:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:30:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2022-11-02 20:30:55,253 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7274853801169591 [2022-11-02 20:30:55,253 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2022-11-02 20:30:55,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2022-11-02 20:30:55,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:55,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2022-11-02 20:30:55,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,265 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,265 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 468 flow. Second operand 6 states and 1244 transitions. [2022-11-02 20:30:55,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 228 transitions, 596 flow [2022-11-02 20:30:55,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 228 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:30:55,271 INFO L231 Difference]: Finished difference. Result has 232 places, 228 transitions, 483 flow [2022-11-02 20:30:55,272 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=232, PETRI_TRANSITIONS=228} [2022-11-02 20:30:55,275 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -25 predicate places. [2022-11-02 20:30:55,275 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 228 transitions, 483 flow [2022-11-02 20:30:55,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:55,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:55,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:30:55,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash -633740637, now seen corresponding path program 1 times [2022-11-02 20:30:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:55,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169954823] [2022-11-02 20:30:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:55,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169954823] [2022-11-02 20:30:55,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169954823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:55,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:55,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498345540] [2022-11-02 20:30:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:55,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:55,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:55,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:55,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:55,383 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-11-02 20:30:55,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 228 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:55,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-11-02 20:30:55,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:55,623 INFO L130 PetriNetUnfolder]: 133/744 cut-off events. [2022-11-02 20:30:55,623 INFO L131 PetriNetUnfolder]: For 26/30 co-relation queries the response was YES. [2022-11-02 20:30:55,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 744 events. 133/744 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3873 event pairs, 74 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 932. Up to 189 conditions per place. [2022-11-02 20:30:55,631 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 16 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2022-11-02 20:30:55,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 517 flow [2022-11-02 20:30:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2022-11-02 20:30:55,635 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8818713450292398 [2022-11-02 20:30:55,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 754 transitions. [2022-11-02 20:30:55,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 754 transitions. [2022-11-02 20:30:55,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:55,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 754 transitions. [2022-11-02 20:30:55,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,642 INFO L175 Difference]: Start difference. First operand has 232 places, 228 transitions, 483 flow. Second operand 3 states and 754 transitions. [2022-11-02 20:30:55,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 517 flow [2022-11-02 20:30:55,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 227 transitions, 497 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:30:55,648 INFO L231 Difference]: Finished difference. Result has 228 places, 227 transitions, 465 flow [2022-11-02 20:30:55,649 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=228, PETRI_TRANSITIONS=227} [2022-11-02 20:30:55,650 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -29 predicate places. [2022-11-02 20:30:55,650 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 227 transitions, 465 flow [2022-11-02 20:30:55,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:55,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:55,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:30:55,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash 65499299, now seen corresponding path program 1 times [2022-11-02 20:30:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:55,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907770680] [2022-11-02 20:30:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:55,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:55,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907770680] [2022-11-02 20:30:55,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907770680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:55,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:55,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884409291] [2022-11-02 20:30:55,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:55,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:55,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:55,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:55,733 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-11-02 20:30:55,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 227 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:55,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-11-02 20:30:55,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:55,854 INFO L130 PetriNetUnfolder]: 44/356 cut-off events. [2022-11-02 20:30:55,854 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-11-02 20:30:55,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 356 events. 44/356 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 997 event pairs, 20 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 398. Up to 64 conditions per place. [2022-11-02 20:30:55,859 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 13 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2022-11-02 20:30:55,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 493 flow [2022-11-02 20:30:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2022-11-02 20:30:55,862 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-11-02 20:30:55,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2022-11-02 20:30:55,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2022-11-02 20:30:55,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:55,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2022-11-02 20:30:55,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,869 INFO L175 Difference]: Start difference. First operand has 228 places, 227 transitions, 465 flow. Second operand 3 states and 760 transitions. [2022-11-02 20:30:55,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 493 flow [2022-11-02 20:30:55,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:55,876 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 463 flow [2022-11-02 20:30:55,877 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-11-02 20:30:55,877 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2022-11-02 20:30:55,878 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 463 flow [2022-11-02 20:30:55,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:55,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:55,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:30:55,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash 335773767, now seen corresponding path program 1 times [2022-11-02 20:30:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:55,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045101027] [2022-11-02 20:30:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045101027] [2022-11-02 20:30:55,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045101027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:55,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:55,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287956067] [2022-11-02 20:30:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:55,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:55,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:55,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:55,981 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-11-02 20:30:55,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:55,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:55,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-11-02 20:30:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:56,222 INFO L130 PetriNetUnfolder]: 173/855 cut-off events. [2022-11-02 20:30:56,222 INFO L131 PetriNetUnfolder]: For 26/32 co-relation queries the response was YES. [2022-11-02 20:30:56,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 855 events. 173/855 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4768 event pairs, 74 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 1108. Up to 175 conditions per place. [2022-11-02 20:30:56,232 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 19 selfloop transitions, 2 changer transitions 2/230 dead transitions. [2022-11-02 20:30:56,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 230 transitions, 517 flow [2022-11-02 20:30:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2022-11-02 20:30:56,236 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2022-11-02 20:30:56,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 759 transitions. [2022-11-02 20:30:56,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 759 transitions. [2022-11-02 20:30:56,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:56,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 759 transitions. [2022-11-02 20:30:56,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,242 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 463 flow. Second operand 3 states and 759 transitions. [2022-11-02 20:30:56,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 230 transitions, 517 flow [2022-11-02 20:30:56,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 230 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:56,248 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 455 flow [2022-11-02 20:30:56,249 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2022-11-02 20:30:56,250 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -32 predicate places. [2022-11-02 20:30:56,250 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 455 flow [2022-11-02 20:30:56,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:56,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:56,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:30:56,252 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash 556067529, now seen corresponding path program 1 times [2022-11-02 20:30:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:56,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417524648] [2022-11-02 20:30:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:56,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417524648] [2022-11-02 20:30:56,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417524648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:56,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:56,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414293537] [2022-11-02 20:30:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:56,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:56,345 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-11-02 20:30:56,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:56,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-11-02 20:30:56,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:56,583 INFO L130 PetriNetUnfolder]: 113/713 cut-off events. [2022-11-02 20:30:56,583 INFO L131 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-11-02 20:30:56,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 713 events. 113/713 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3473 event pairs, 12 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 878. Up to 147 conditions per place. [2022-11-02 20:30:56,592 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-02 20:30:56,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 230 transitions, 522 flow [2022-11-02 20:30:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2022-11-02 20:30:56,596 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2022-11-02 20:30:56,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2022-11-02 20:30:56,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2022-11-02 20:30:56,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:56,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2022-11-02 20:30:56,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,603 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 455 flow. Second operand 3 states and 768 transitions. [2022-11-02 20:30:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 230 transitions, 522 flow [2022-11-02 20:30:56,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 230 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:56,611 INFO L231 Difference]: Finished difference. Result has 223 places, 223 transitions, 463 flow [2022-11-02 20:30:56,612 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=223, PETRI_TRANSITIONS=223} [2022-11-02 20:30:56,613 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2022-11-02 20:30:56,613 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 223 transitions, 463 flow [2022-11-02 20:30:56,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:56,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:56,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:30:56,615 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash 69936621, now seen corresponding path program 1 times [2022-11-02 20:30:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:56,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330101388] [2022-11-02 20:30:56,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:56,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330101388] [2022-11-02 20:30:56,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330101388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:56,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:56,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:30:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59839807] [2022-11-02 20:30:56,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:56,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:30:56,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:56,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:30:56,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:30:56,876 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 285 [2022-11-02 20:30:56,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 223 transitions, 463 flow. Second operand has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:56,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 285 [2022-11-02 20:30:56,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:58,606 INFO L130 PetriNetUnfolder]: 1939/5317 cut-off events. [2022-11-02 20:30:58,606 INFO L131 PetriNetUnfolder]: For 280/386 co-relation queries the response was YES. [2022-11-02 20:30:58,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8549 conditions, 5317 events. 1939/5317 cut-off events. For 280/386 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 43612 event pairs, 1024 based on Foata normal form. 1/4352 useless extension candidates. Maximal degree in co-relation 8514. Up to 1732 conditions per place. [2022-11-02 20:30:58,661 INFO L137 encePairwiseOnDemand]: 271/285 looper letters, 148 selfloop transitions, 18 changer transitions 0/326 dead transitions. [2022-11-02 20:30:58,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 326 transitions, 1037 flow [2022-11-02 20:30:58,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:30:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:30:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2352 transitions. [2022-11-02 20:30:58,668 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7502392344497608 [2022-11-02 20:30:58,668 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2352 transitions. [2022-11-02 20:30:58,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2352 transitions. [2022-11-02 20:30:58,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:58,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2352 transitions. [2022-11-02 20:30:58,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 213.8181818181818) internal successors, (2352), 11 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:58,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:58,685 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:58,685 INFO L175 Difference]: Start difference. First operand has 223 places, 223 transitions, 463 flow. Second operand 11 states and 2352 transitions. [2022-11-02 20:30:58,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 326 transitions, 1037 flow [2022-11-02 20:30:58,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 326 transitions, 1037 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:30:58,693 INFO L231 Difference]: Finished difference. Result has 237 places, 233 transitions, 549 flow [2022-11-02 20:30:58,694 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=549, PETRI_PLACES=237, PETRI_TRANSITIONS=233} [2022-11-02 20:30:58,695 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -20 predicate places. [2022-11-02 20:30:58,695 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 233 transitions, 549 flow [2022-11-02 20:30:58,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:58,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:58,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:58,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:30:58,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:30:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1505767668, now seen corresponding path program 1 times [2022-11-02 20:30:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:58,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827270695] [2022-11-02 20:30:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827270695] [2022-11-02 20:30:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827270695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:59,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:59,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73095010] [2022-11-02 20:30:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:59,369 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-02 20:30:59,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 233 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:59,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:59,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-02 20:30:59,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:01,861 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:01,862 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-02 20:31:01,862 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:01,862 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:01,862 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-02 20:31:01,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][187], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 66#L97-4true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,000 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-02 20:31:02,000 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-02 20:31:02,000 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:31:02,000 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-02 20:31:02,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 271#L75true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,050 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-02 20:31:02,050 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 20:31:02,051 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 20:31:02,051 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-02 20:31:02,052 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, 182#L98-5true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 271#L75true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,052 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-02 20:31:02,053 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-02 20:31:02,053 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-02 20:31:02,053 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-02 20:31:02,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 271#L75true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 58#L61true, 340#true]) [2022-11-02 20:31:02,054 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:31:02,054 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:31:02,054 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:31:02,054 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:02,055 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][187], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 145#L98-1true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 271#L75true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,055 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-02 20:31:02,055 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:02,055 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:02,055 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-02 20:31:02,056 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 271#L75true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,056 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-11-02 20:31:02,056 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:31:02,057 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:31:02,057 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-11-02 20:31:02,057 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, 211#L98-2true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 271#L75true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,057 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-02 20:31:02,058 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-02 20:31:02,058 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:31:02,058 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:31:02,077 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, 182#L98-5true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,077 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-02 20:31:02,077 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:31:02,077 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-02 20:31:02,078 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:31:02,078 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,078 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-02 20:31:02,079 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:02,079 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:02,079 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-02 20:31:02,079 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-02 20:31:02,080 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 58#L61true, 340#true]) [2022-11-02 20:31:02,080 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-02 20:31:02,080 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-02 20:31:02,080 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-02 20:31:02,080 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-02 20:31:02,081 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][187], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 145#L98-1true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,081 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:31:02,081 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-02 20:31:02,081 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:02,082 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-02 20:31:02,082 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,082 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-02 20:31:02,082 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:31:02,083 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-02 20:31:02,083 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-02 20:31:02,083 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, 211#L98-2true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,084 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-02 20:31:02,084 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:31:02,084 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-02 20:31:02,084 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-02 20:31:02,106 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, 182#L98-5true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,107 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-02 20:31:02,107 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-02 20:31:02,107 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-02 20:31:02,107 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-02 20:31:02,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 86#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,108 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-02 20:31:02,108 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:31:02,108 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-02 20:31:02,108 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-02 20:31:02,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 58#L61true, 340#true]) [2022-11-02 20:31:02,109 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-02 20:31:02,109 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 20:31:02,110 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-02 20:31:02,110 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-02 20:31:02,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][187], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 145#L98-1true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,111 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-11-02 20:31:02,111 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-11-02 20:31:02,111 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:31:02,111 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:31:02,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,112 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-02 20:31:02,112 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-02 20:31:02,112 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-02 20:31:02,112 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-02 20:31:02,113 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 211#L98-2true, 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,113 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:31:02,113 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:02,113 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:31:02,113 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:31:02,129 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][187], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 66#L97-4true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 271#L75true, Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,130 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-02 20:31:02,130 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-02 20:31:02,130 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:31:02,130 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-02 20:31:02,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][187], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 66#L97-4true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 265#L51-3true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-02 20:31:02,164 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-02 20:31:02,164 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:31:02,164 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:31:02,165 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-02 20:31:02,266 INFO L130 PetriNetUnfolder]: 3007/7208 cut-off events. [2022-11-02 20:31:02,267 INFO L131 PetriNetUnfolder]: For 994/1039 co-relation queries the response was YES. [2022-11-02 20:31:02,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12995 conditions, 7208 events. 3007/7208 cut-off events. For 994/1039 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 59325 event pairs, 899 based on Foata normal form. 36/6533 useless extension candidates. Maximal degree in co-relation 12953. Up to 2638 conditions per place. [2022-11-02 20:31:02,386 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 99 selfloop transitions, 13 changer transitions 0/296 dead transitions. [2022-11-02 20:31:02,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 296 transitions, 922 flow [2022-11-02 20:31:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1380 transitions. [2022-11-02 20:31:02,393 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8070175438596491 [2022-11-02 20:31:02,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1380 transitions. [2022-11-02 20:31:02,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1380 transitions. [2022-11-02 20:31:02,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:02,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1380 transitions. [2022-11-02 20:31:02,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,405 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,405 INFO L175 Difference]: Start difference. First operand has 237 places, 233 transitions, 549 flow. Second operand 6 states and 1380 transitions. [2022-11-02 20:31:02,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 296 transitions, 922 flow [2022-11-02 20:31:02,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 296 transitions, 917 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:02,424 INFO L231 Difference]: Finished difference. Result has 245 places, 245 transitions, 654 flow [2022-11-02 20:31:02,425 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=245, PETRI_TRANSITIONS=245} [2022-11-02 20:31:02,426 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -12 predicate places. [2022-11-02 20:31:02,427 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 245 transitions, 654 flow [2022-11-02 20:31:02,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:02,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:02,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:31:02,429 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:31:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -254816675, now seen corresponding path program 1 times [2022-11-02 20:31:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:02,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923832078] [2022-11-02 20:31:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:02,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923832078] [2022-11-02 20:31:02,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923832078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:02,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:02,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:31:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583329782] [2022-11-02 20:31:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:02,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:31:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:31:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:31:02,726 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 285 [2022-11-02 20:31:02,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 245 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:02,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 285 [2022-11-02 20:31:02,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:04,656 INFO L130 PetriNetUnfolder]: 2622/5781 cut-off events. [2022-11-02 20:31:04,657 INFO L131 PetriNetUnfolder]: For 3467/4069 co-relation queries the response was YES. [2022-11-02 20:31:04,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 5781 events. 2622/5781 cut-off events. For 3467/4069 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 44391 event pairs, 1283 based on Foata normal form. 40/4693 useless extension candidates. Maximal degree in co-relation 11632. Up to 3250 conditions per place. [2022-11-02 20:31:04,753 INFO L137 encePairwiseOnDemand]: 271/285 looper letters, 133 selfloop transitions, 18 changer transitions 0/324 dead transitions. [2022-11-02 20:31:04,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 324 transitions, 1138 flow [2022-11-02 20:31:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:31:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:31:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2410 transitions. [2022-11-02 20:31:04,762 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7687400318979266 [2022-11-02 20:31:04,762 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2410 transitions. [2022-11-02 20:31:04,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2410 transitions. [2022-11-02 20:31:04,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:04,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2410 transitions. [2022-11-02 20:31:04,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 219.0909090909091) internal successors, (2410), 11 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:04,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:04,785 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:04,785 INFO L175 Difference]: Start difference. First operand has 245 places, 245 transitions, 654 flow. Second operand 11 states and 2410 transitions. [2022-11-02 20:31:04,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 324 transitions, 1138 flow [2022-11-02 20:31:04,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 324 transitions, 1138 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:31:04,801 INFO L231 Difference]: Finished difference. Result has 257 places, 247 transitions, 702 flow [2022-11-02 20:31:04,802 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=702, PETRI_PLACES=257, PETRI_TRANSITIONS=247} [2022-11-02 20:31:04,804 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, 0 predicate places. [2022-11-02 20:31:04,805 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 247 transitions, 702 flow [2022-11-02 20:31:04,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:04,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:04,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:04,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:31:04,828 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:31:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash -334268178, now seen corresponding path program 1 times [2022-11-02 20:31:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:04,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358516243] [2022-11-02 20:31:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:05,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358516243] [2022-11-02 20:31:05,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358516243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:05,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250398744] [2022-11-02 20:31:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:05,599 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-02 20:31:05,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 247 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:05,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-02 20:31:05,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:07,843 INFO L130 PetriNetUnfolder]: 2201/6871 cut-off events. [2022-11-02 20:31:07,843 INFO L131 PetriNetUnfolder]: For 3758/3788 co-relation queries the response was YES. [2022-11-02 20:31:07,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13361 conditions, 6871 events. 2201/6871 cut-off events. For 3758/3788 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 66707 event pairs, 1289 based on Foata normal form. 24/6560 useless extension candidates. Maximal degree in co-relation 13312. Up to 2846 conditions per place. [2022-11-02 20:31:07,938 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 80 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2022-11-02 20:31:07,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 283 transitions, 1038 flow [2022-11-02 20:31:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1349 transitions. [2022-11-02 20:31:07,945 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2022-11-02 20:31:07,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1349 transitions. [2022-11-02 20:31:07,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1349 transitions. [2022-11-02 20:31:07,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:07,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1349 transitions. [2022-11-02 20:31:07,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,957 INFO L175 Difference]: Start difference. First operand has 257 places, 247 transitions, 702 flow. Second operand 6 states and 1349 transitions. [2022-11-02 20:31:07,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 283 transitions, 1038 flow [2022-11-02 20:31:08,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 283 transitions, 1021 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:31:08,007 INFO L231 Difference]: Finished difference. Result has 262 places, 263 transitions, 869 flow [2022-11-02 20:31:08,007 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=262, PETRI_TRANSITIONS=263} [2022-11-02 20:31:08,008 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, 5 predicate places. [2022-11-02 20:31:08,008 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 263 transitions, 869 flow [2022-11-02 20:31:08,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:08,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:08,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:31:08,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:31:08,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2126054492, now seen corresponding path program 1 times [2022-11-02 20:31:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:08,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478789074] [2022-11-02 20:31:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:08,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:31:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:08,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478789074] [2022-11-02 20:31:08,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478789074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:08,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:08,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882763366] [2022-11-02 20:31:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:08,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:08,868 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 285 [2022-11-02 20:31:08,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 263 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:08,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 285 [2022-11-02 20:31:08,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:12,552 INFO L130 PetriNetUnfolder]: 4882/12923 cut-off events. [2022-11-02 20:31:12,553 INFO L131 PetriNetUnfolder]: For 11447/11447 co-relation queries the response was YES. [2022-11-02 20:31:12,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28061 conditions, 12923 events. 4882/12923 cut-off events. For 11447/11447 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 131795 event pairs, 1972 based on Foata normal form. 0/12545 useless extension candidates. Maximal degree in co-relation 28011. Up to 5365 conditions per place. [2022-11-02 20:31:12,740 INFO L137 encePairwiseOnDemand]: 277/285 looper letters, 143 selfloop transitions, 26 changer transitions 0/349 dead transitions. [2022-11-02 20:31:12,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 349 transitions, 1635 flow [2022-11-02 20:31:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1367 transitions. [2022-11-02 20:31:12,745 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7994152046783626 [2022-11-02 20:31:12,745 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1367 transitions. [2022-11-02 20:31:12,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1367 transitions. [2022-11-02 20:31:12,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:12,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1367 transitions. [2022-11-02 20:31:12,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,756 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,756 INFO L175 Difference]: Start difference. First operand has 262 places, 263 transitions, 869 flow. Second operand 6 states and 1367 transitions. [2022-11-02 20:31:12,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 349 transitions, 1635 flow [2022-11-02 20:31:12,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 349 transitions, 1635 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:31:12,915 INFO L231 Difference]: Finished difference. Result has 272 places, 288 transitions, 1173 flow [2022-11-02 20:31:12,916 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1173, PETRI_PLACES=272, PETRI_TRANSITIONS=288} [2022-11-02 20:31:12,919 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, 15 predicate places. [2022-11-02 20:31:12,919 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 288 transitions, 1173 flow [2022-11-02 20:31:12,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:12,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:31:12,921 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:31:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1237774503, now seen corresponding path program 1 times [2022-11-02 20:31:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:12,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230583851] [2022-11-02 20:31:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:31:13,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:13,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230583851] [2022-11-02 20:31:13,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230583851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:13,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:13,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970067418] [2022-11-02 20:31:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:13,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:13,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:13,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:13,008 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 285 [2022-11-02 20:31:13,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 288 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:13,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:13,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 285 [2022-11-02 20:31:13,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:14,745 INFO L130 PetriNetUnfolder]: 2145/6631 cut-off events. [2022-11-02 20:31:14,745 INFO L131 PetriNetUnfolder]: For 17835/18181 co-relation queries the response was YES. [2022-11-02 20:31:14,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 6631 events. 2145/6631 cut-off events. For 17835/18181 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 63922 event pairs, 664 based on Foata normal form. 0/6368 useless extension candidates. Maximal degree in co-relation 16488. Up to 2137 conditions per place. [2022-11-02 20:31:14,840 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 70 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-02 20:31:14,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 302 transitions, 1441 flow [2022-11-02 20:31:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2022-11-02 20:31:14,846 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.87953216374269 [2022-11-02 20:31:14,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2022-11-02 20:31:14,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2022-11-02 20:31:14,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:14,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2022-11-02 20:31:14,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:14,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:14,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:14,863 INFO L175 Difference]: Start difference. First operand has 272 places, 288 transitions, 1173 flow. Second operand 3 states and 752 transitions. [2022-11-02 20:31:14,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 302 transitions, 1441 flow [2022-11-02 20:31:14,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 302 transitions, 1371 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-11-02 20:31:15,004 INFO L231 Difference]: Finished difference. Result has 273 places, 287 transitions, 1119 flow [2022-11-02 20:31:15,005 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=273, PETRI_TRANSITIONS=287} [2022-11-02 20:31:15,007 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, 16 predicate places. [2022-11-02 20:31:15,007 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 287 transitions, 1119 flow [2022-11-02 20:31:15,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:15,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:15,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:15,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:31:15,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:31:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1866306840, now seen corresponding path program 1 times [2022-11-02 20:31:15,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:15,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583406236] [2022-11-02 20:31:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:15,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583406236] [2022-11-02 20:31:15,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583406236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:15,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:15,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913377676] [2022-11-02 20:31:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:15,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:15,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:15,894 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-02 20:31:15,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 287 transitions, 1119 flow. Second operand has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:15,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:15,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-02 20:31:15,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:18,590 INFO L130 PetriNetUnfolder]: 3208/9688 cut-off events. [2022-11-02 20:31:18,590 INFO L131 PetriNetUnfolder]: For 11422/12194 co-relation queries the response was YES. [2022-11-02 20:31:18,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22046 conditions, 9688 events. 3208/9688 cut-off events. For 11422/12194 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 101239 event pairs, 1752 based on Foata normal form. 0/9526 useless extension candidates. Maximal degree in co-relation 21989. Up to 4485 conditions per place. [2022-11-02 20:31:18,713 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 104 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-11-02 20:31:18,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 294 transitions, 1349 flow [2022-11-02 20:31:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1328 transitions. [2022-11-02 20:31:18,725 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.776608187134503 [2022-11-02 20:31:18,726 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1328 transitions. [2022-11-02 20:31:18,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1328 transitions. [2022-11-02 20:31:18,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:18,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1328 transitions. [2022-11-02 20:31:18,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.33333333333334) internal successors, (1328), 6 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:18,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:18,742 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:18,743 INFO L175 Difference]: Start difference. First operand has 273 places, 287 transitions, 1119 flow. Second operand 6 states and 1328 transitions. [2022-11-02 20:31:18,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 294 transitions, 1349 flow [2022-11-02 20:31:18,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 294 transitions, 1345 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:18,828 INFO L231 Difference]: Finished difference. Result has 275 places, 286 transitions, 1121 flow [2022-11-02 20:31:18,829 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1121, PETRI_PLACES=275, PETRI_TRANSITIONS=286} [2022-11-02 20:31:18,830 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, 18 predicate places. [2022-11-02 20:31:18,830 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 286 transitions, 1121 flow [2022-11-02 20:31:18,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:18,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:18,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:18,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:31:18,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:31:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1761316457, now seen corresponding path program 1 times [2022-11-02 20:31:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226842918] [2022-11-02 20:31:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:31:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:20,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226842918] [2022-11-02 20:31:20,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226842918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:20,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:20,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:31:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441648534] [2022-11-02 20:31:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:20,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:31:20,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:31:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:31:20,576 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-11-02 20:31:20,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 286 transitions, 1121 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:20,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:20,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-11-02 20:31:20,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:41,752 INFO L130 PetriNetUnfolder]: 40337/70492 cut-off events. [2022-11-02 20:31:41,752 INFO L131 PetriNetUnfolder]: For 59806/59845 co-relation queries the response was YES. [2022-11-02 20:31:42,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180425 conditions, 70492 events. 40337/70492 cut-off events. For 59806/59845 co-relation queries the response was YES. Maximal size of possible extension queue 2339. Compared 669473 event pairs, 11295 based on Foata normal form. 333/69584 useless extension candidates. Maximal degree in co-relation 180361. Up to 15605 conditions per place. [2022-11-02 20:31:42,711 INFO L137 encePairwiseOnDemand]: 262/285 looper letters, 393 selfloop transitions, 70 changer transitions 0/607 dead transitions. [2022-11-02 20:31:42,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 607 transitions, 4099 flow [2022-11-02 20:31:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:31:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-02 20:31:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4272 transitions. [2022-11-02 20:31:42,726 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6517162471395881 [2022-11-02 20:31:42,726 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4272 transitions. [2022-11-02 20:31:42,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4272 transitions. [2022-11-02 20:31:42,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:42,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4272 transitions. [2022-11-02 20:31:42,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 185.7391304347826) internal successors, (4272), 23 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:42,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:42,766 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:42,766 INFO L175 Difference]: Start difference. First operand has 275 places, 286 transitions, 1121 flow. Second operand 23 states and 4272 transitions. [2022-11-02 20:31:42,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 607 transitions, 4099 flow [2022-11-02 20:31:43,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 607 transitions, 4071 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:31:43,878 INFO L231 Difference]: Finished difference. Result has 298 places, 335 transitions, 1856 flow [2022-11-02 20:31:43,879 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1856, PETRI_PLACES=298, PETRI_TRANSITIONS=335} [2022-11-02 20:31:43,880 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, 41 predicate places. [2022-11-02 20:31:43,880 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 335 transitions, 1856 flow [2022-11-02 20:31:43,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:43,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:43,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:43,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:31:43,883 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:31:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash 212905121, now seen corresponding path program 2 times [2022-11-02 20:31:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:43,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051243204] [2022-11-02 20:31:43,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:31:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:45,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051243204] [2022-11-02 20:31:45,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051243204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:45,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:45,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:31:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181879401] [2022-11-02 20:31:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:45,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:31:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:31:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:31:45,687 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-11-02 20:31:45,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 335 transitions, 1856 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:45,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:45,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-11-02 20:31:45,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand